Justifications in Constraint Handling Rules for Logical Retraction in Dynamic Algorithms
| Autor: | Thom Frühwirth |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Scheme (programming language)
Constraint Handling Rules Theoretical computer science Correctness Computer science Computation 0102 computer and information sciences 02 engineering and technology Undo 01 natural sciences Constraint (information theory) TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Transformation (function) 010201 computation theory & mathematics Confluence 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing computer computer.programming_language |
| Zdroj: | Logic-Based Program Synthesis and Transformation ISBN: 9783319944593 LOPSTR |
| DOI: | 10.1007/978-3-319-94460-9_9 |
| Popis: | We present a straightforward source-to-source transformation that introduces justifications for user-defined constraints into the CHR programming language. Then a scheme of two rules suffices to allow for logical retraction (deletion, removal) of constraints during computation. Without the need to recompute from scratch, these rules remove not only the constraint but also undo all consequences of the rule applications that involved the constraint. We prove a confluence result concerning the rule scheme and show its correctness. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|