Publication details

Saarland University Computer Science

Equational and Membership Constraints for Infinite Trees

Joachim Niehren, Andreas Podelski, Ralf Treinen

5th International Conference on Rewriting Techniques and Applications, pp. 106-120, Springer-Verlag, June 1993

We present a new constraint system with equational and membership constraints over infinite trees. It provides for complete and correct satisfiability and entailment tests and is therefore suitable for the use in concurrent constraint programming systems which are based on cyclic data structures.
of regular systems of equations with a deterministic form of union. As the main technical particularity of the algorithms we present a novel memorization technique. We believe that both satisfiability and entailment tests can be implemented in an efficient and incremental manner.

Download PDF        Show BibTeX               

Login to edit

Legal notice, Privacy policy