From decomposable to residual theories

DOI10.1016/j.amc.2009.07.029zbMath1192.68641OpenAlexW1988428040MaRDI QIDQ1045812

Khalil Djelloul

Publication date: 16 December 2009

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2009.07.029

zbMATH Keywords

first-order logicdecision procedurecomplete theoriesfirst-order constraints

Mathematics Subject Classification ID

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

Cites Work

• 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
• Solving First-Order Constraints in the Theory of the Evaluated Trees
• Decomposable theories
• Frontiers of Combining Systems
• A Full First-Order Constraint Solver for Decomposable Theories
• Unnamed Item
• Unnamed Item

This page was built for publication: From decomposable to residual theories