ACD Term Rewriting
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.
KeywordsOperational Semantic Constraint Model Propagation History Execution State Equational Logic
Unable to display preview. Download preview PDF.
- 3.Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, Cambridge (1998)Google Scholar
- 6.Menezes, L., Vitorino, J., Aurelio, M.: A High Performance CHR ∨ Execution Engine. In: Second Workshop on Constraint Handling Rules, Sitges, Spain (2005)Google Scholar
- 7.Stuckey, P.J., de la Banda, M.G., Maher, M.J., Marriott, K., Slaney, J.K., Somogyi, Z., Wallace, M., Walsh, T.: The G12 Project: Mapping Solver Independent Models to Efficient Solutions. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 9–13. Springer, Heidelberg (2005)CrossRefGoogle Scholar