Login / Signup

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

Marc MeisterKhalil DjelloulThom W. Frühwirth
Published in: CSCLP (2006)
Keyphrases
  • existentially quantified
  • constraint handling rules
  • logic programs
  • universally quantified
  • computational complexity
  • background knowledge
  • decision problems