A full first-order constraint solver for decomposable theories

DOI10.1007/s10472-009-9142-9zbMath1183.68557OpenAlexW2043633856MaRDI QIDQ1044229

Khalil Djelloul

Publication date: 11 December 2009

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-009-9142-9

zbMATH Keywords

decomposabilityrewriting rules

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic
• Expressiveness of full first-order constraints in the algebra of finite or infinite trees
• A decision procedure for term algebras with queues
• Theory of finite or infinite trees revisited
• Principles of Constraint Programming
• Solving First-Order Constraints in the Theory of the Evaluated Trees
• Extension of First-Order Theories into Trees
• Decomposable theories
• Frontiers of Combining Systems
• A Full First-Order Constraint Solver for Decomposable Theories

This page was built for publication: A full first-order constraint solver for decomposable theories