ACD term rewriting

Authors:
Gregory J. Duck;Peter J. Stuckey;Sebastian Brand
Affiliations:
NICTA Victoria Laboratory, Department of Computer Science & Software Engineering, University of Melbourne, Australia;NICTA Victoria Laboratory, Department of Computer Science & Software Engineering, University of Melbourne, Australia;NICTA Victoria Laboratory, Department of Computer Science & Software Engineering, University of Melbourne, Australia
Venue:
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Year:
2006

Citing 3
Cited 11

Term rewriting and all that

Term rewriting and all that
CHRv: A Flexible Query Language

FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
The g12 project: mapping solver independent models to efficient solutions

ICLP'05 Proceedings of the 21st international conference on Logic Programming

Cadmium: An Implementation of ACD Term Rewriting

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Logical algorithms meets chr: A meta-complexity result for constraint handling rules with rule priorities

Theory and Practice of Logic Programming
Demand-Driven Normalisation for ACD Term Rewriting

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
MiniZinc: towards a standard CP modelling language

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Flexible, rule-based constraint model linearisation

PADL'08 Proceedings of the 10th international conference on Practical aspects of declarative languages
From high-level model to branch-and-price solution in G12

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Dantzig-Wolfe decomposition and branch-and-price solving in G12

Constraints
Analysing graph transformation systems through constraint handling rules

Theory and Practice of Logic Programming
Parameterized models for on-line and off-line use

WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
From zinc to design model

PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
A high level language for solver independent model manipulation and generation of hybrid solvers

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

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.