Resolution of Constraints in Algebras of Rational Trees

Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in polynomial time, the size of the constraints using a rewriting system before applying a complete algorithm. This rewriting system works essentially by rewriting constraints using the information in a partial model. An efficient C implementation of the rewriting system is described and an algorithm for factoring complex constraints is also presented.

• Type: Conference
• Year: 1993
• Where: EPIA
• Authors: Luís Damas, Nelma Moreira, Sabine Broda
• Keywords: Artificial Intelligence, Constraint Solver, EPIA 1993, Rational Trees, Rewriting System