Automatic Combinability of Rewriting-Based Satisfiability Procedures

DOI10.1007/11916277_37MaRDI QIDQ5387918zbMATH OpenOpenAlexFDO

Authors Hélène Kirchner, Silvio Ranise, Christophe Ringeissen, 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

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Frontiers of Combining Systems
• Theoretical Aspects of Computing – ICTAC 2005
• Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
• Model-theoretic methods in combined constraint satisfiability
• A rewriting approach to satisfiability procedures.

Cited in

(12)

• Theory decision by decomposition
• Combination of convex theories: modularity, deduction completeness, and explanation
• A rewriting approach to satisfiability procedures.
• A rewriting approach to the combination of data structures with bridging theories
• Modular termination and combinability for superposition modulo counter arithmetic
• Automatic Decidability and Combinability Revisited
• Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
• Automated Synthesis of Combinational Logic Using Theorem-Proving Techniques
• An instantiation scheme for satisfiability modulo theories
• scientific article; zbMATH DE number 1396671 (Why is no real title available?)
• Theoretical Aspects of Computing – ICTAC 2005
• Automatic decidability and combinability

This page was built for publication: Automatic Combinability of Rewriting-Based Satisfiability Procedures

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