Abstract
In this paper we introduce Associative Commutative Distributive Term Rewriting (ACDTR), a rewriting language for rewriting logical formulae. ACDTR extends AC term rewriting by adding distribution of conjunction over other operators. Conjunction is vital for expressive term rewriting systems since it allows us to require that multiple conditions hold for a term rewriting rule to be used. ACDTR uses the notion of a "conjunctive context", which is the conjunction of constraints that must hold in the context of a term, to enable the programmer to write very expressive and targeted rewriting rules. ACDTR can be seen as a general logic programming language that extends Constraint Handling Rules and AC term rewriting. In this paper we define the semantics of ACDTR and describe our prototype implementation.
| Original language | English |
|---|---|
| Title of host publication | Logic Programming - 22nd International Conference, ICLP 2006, Proceedings |
| Publisher | Springer |
| Pages | 117-131 |
| Number of pages | 15 |
| ISBN (Print) | 9783540366355 |
| Publication status | Published - 1 Jan 2006 |
| Externally published | Yes |
| Event | International Conference on Logic Programming 2006 - Seattle, United States of America Duration: 17 Aug 2006 → 20 Aug 2006 Conference number: 22nd https://link.springer.com/book/10.1007/11799573 (Proceedings) |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 4079 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | International Conference on Logic Programming 2006 |
|---|---|
| Abbreviated title | ICLP 2006 |
| Country/Territory | United States of America |
| City | Seattle |
| Period | 17/08/06 → 20/08/06 |
| Internet address |
|