Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees

Abstract. Constraint Handling Rules (CHR) is a concurrent, committed-choice, rule-based language. One of the first CHR programs is the classic constraint solver for syntactic equality of rational trees that performs unification. We first prove its exponential complexity in time and space for non-flat equations and deduce from this proof a quadratic complexity for flat equations. We then present an extended CHR solver for solving existentially quantified conjunctions of non-flat equations in the theory of finite or infinite trees. We reach a quadratic complexity by first flattening the equations and introducing new existentially quantified variables, then using the classic solver, and finally eliminating particular equations and quantified variables.

• Type: Conference
• Year: 2006
• Where: CSCLP
• Authors: Marc Meister, Khalil Djelloul, Thom W. Frühwirth
• Keywords: Artificial Intelligence, CSCLP 2006, Existentially Quantified, Non-flat Equations, Quadratic Complexity