Skip to Main content Skip to Navigation
Conference papers

Equational and Membership Constraints for Infinite Trees

Abstract : 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.Our set defining devices are greatest fixpoint solutions of iregular 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.
Document type :
Conference papers
Complete list of metadata

https://hal.inria.fr/inria-00536824
Contributor : Joachim Niehren <>
Submitted on : Saturday, November 20, 2010 - 2:53:03 PM
Last modification on : Thursday, July 8, 2021 - 3:48:35 AM
Long-term archiving on: : Monday, February 21, 2011 - 2:23:17 AM

File

equational.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00536824, version 1

Collections

Citation

Joachim Niehren, Andreas Podelski, Ralf Treinen. Equational and Membership Constraints for Infinite Trees. 5th International Conference on Rewriting Techniques and Applications, 1993, Montreal, Canada. pp.106-120. ⟨inria-00536824⟩

Share

Metrics

Record views

271

Files downloads

211