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

DOI10.1007/978-3-540-73817-6_9zbMATH Open1176.68201OpenAlexW1519562781MaRDI QIDQ3608450FDOQ3608450

Authors: Marc Meister, Khalil Djelloul, Thom Frühwirth 

Publication date: 5 March 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73817-6_9

Recommendations

• Theory and practice of constraint handling rules
• Confluence and semantics of constraint simplification rules
• SMCHR: satisfiability modulo constraint handling rules
• Optimal union-find in Constraint Handling Rules
• A compositional semantics for CHR

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Cited In (3)

• Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
• On the complexity of equational problems in CNF
• Title not available (Why is that?)

This page was built for publication: Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608450)