A Full First-Order Constraint Solver for Decomposable Theories

DOI10.1007/978-3-540-85110-3_9zbMath1166.68344MaRDI QIDQ5505492

Khalil Djelloul

Publication date: 27 January 2009

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

Mathematics Subject Classification ID

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

Related Items (3)

An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints ⋮ A full first-order constraint solver for decomposable theories ⋮ From decomposable to residual theories

Cites Work

• Unnamed Item
• 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
• An improved lower bound for the elementary theories of trees
• Extension of First-Order Theories into Trees
• Decomposable theories
• Frontiers of Combining Systems

This page was built for publication: A Full First-Order Constraint Solver for Decomposable Theories