Modular instantiation schemes

DOI10.1016/j.ipl.2011.07.003zbMath1260.68370OpenAlexW2052829079MaRDI QIDQ1944184

Mnacho Echenim, Nicolas Peltier

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.07.003

zbMATH Keywords

SMTautomatic theorem provingcombination problemsinstantiation-based methods

Mathematics Subject Classification ID

Cites Work

• An instantiation scheme for satisfiability modulo theories
• Combining nonstably infinite theories
• Decidable fragments of many-sorted logic
• Ordered semantic hyper-linking
• Decision procedures for extensions of the theory of arrays
• Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
• Satisfiability Modulo Theories: An Appetizer
• Automated Deduction – CADE-20
• Verification, Model Checking, and Abstract Interpretation
• Unnamed Item
• Unnamed Item

This page was built for publication: Modular instantiation schemes