Automatic Combinability of Rewriting-Based Satisfiability Procedures
From MaRDI portal
Publication:5387918
DOI10.1007/11916277_37zbMath1165.68490OpenAlexW1580992668MaRDI QIDQ5387918
Silvio Ranise, Christophe Ringeissen, Hélène Kirchner, Duc-Khanh Tran
Publication date: 27 May 2008
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11916277_37
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Grammars and rewriting systems (68Q42)
Related Items
Modular Termination and Combinability for Superposition Modulo Counter Arithmetic, An instantiation scheme for satisfiability modulo theories, Automatic decidability and combinability, Theory decision by decomposition, Combination of convex theories: modularity, deduction completeness, and explanation
