by Armin Wolf
In Proceedings of the Fourth International Conference on Principles and Practice on Constraint Programming, CP`98, Poster Session, number 1520 in Lecture
ftp://ftp.first.gmd.de/pub/plan/cp98-wolf.ps.gz
Add To MetaCart
Abstract:
Abstract. Two variants of an incremental and adaptive unification algorithm are presented. Both variants decide incrementally the consistency of conjunctions of syntactical equations over rational trees after any additions or deletions of syntactical equations. In the positive case, a rational solved form equivalent to the given conjunction is computed incrementally. Contrary to other incremental implementations, our approach uses a simplified form of justifications used in truth maintenance systems instead of a trail. Thus, arbitrary additions and especially arbitrary deletions are supported without chronological backtracking. This flexibility requires set manipulations instead of simple stack operations. This additional effort pays off in dynamic application domains, e.g. the solution of Dynamic Constraint Satisfaction Problems realized with Constraint Handling Rules, where syntactical equations depend on others and on the results of calculations. 1
Citations
|
2005
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
364
|
An Assumption-based TMS
– deKleer
- 1986
|
|
284
|
An efficient unification algorithm
– Martelli, Montanari
- 1982
|
|
213
|
Unification revisited
– Lassez, Maher, et al.
- 2003
|
|
192
|
Warren’s Abstract Machine: A Tutorial Reconstruction
– Ait-Kaci
- 1991
|
|
168
|
Solving equations in abstract algebras: a rule-based survey of unification
– Jouannaud, Kirchner
- 1991
|
|
133
|
Complete axiomatizations of the algebras of the finite, rational, and infinite trees
– Maher
- 1988
|
|
125
|
Fundamental properties of infinite trees
– Courcelle
- 1983
|
|
116
|
Constraint handling rules
– Frühwirth
- 1995
|
|
116
|
Linear unification
– Paterson, Wegman
- 1978
|
|
109
|
Equations and inequations on finite and infinite trees
– Colmerauer
- 1984
|
|
82
|
Unification: A multi-disciplinary survey
– Knight
- 1989
|
|
81
|
Prolog and infinite trees
– Colmerauer
- 1982
|
|
18
|
Using constraints to achieve stability in automatic graph layout algorithms
– Bohringer, Newberry-Paulisch
- 1990
|
|
18
|
Efficient unification over infinite terms
– Jaffar
- 1984
|
|
9
|
Incremental Algorithms for Constraint Solving and Entailment over Rational Trees
– Ramachandran, Hentenryck
- 1993
|
|
8
|
Fundamentals and Logical Foundations of Truth Maintenance. Dissertation no
– Reinfrank
- 1989
|
|
5
|
Operational semantics and confluence of constraint handling rules
– Abdennadher
- 1997
|
|
4
|
Fran��cois Fages. Average-case analysis of unification algorithms
– Albert, Casas
- 1993
|
