Complexity of a CHR solver for existentially quantified conjunctions of equations over trees. - Archive ouverte HAL Access content directly
Conference Papers Lecture Notes in Computer Science Year : 2007

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.
Fichier principal
Vignette du fichier
rac2.pdf (201.34 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-00202313 , version 1 (05-01-2008)

Identifiers

  • HAL Id : hal-00202313 , version 1

Cite

Marc Meister, Khalil Djelloul, Thom Fruehwirth. Complexity of a CHR solver for existentially quantified conjunctions of equations over trees.. Recent advances in constraints Lecture notes in computer science. Revised selected paper csclp 2006., Apr 2007, France. pp.LNAI, Vol 4651. P 139-153. ⟨hal-00202313⟩
265 View
212 Download

Share

Gmail Mastodon Facebook X LinkedIn More