Theory and Applications of Satisfiability Testing

DOI10.1007/11527695zbMath1122.68583OpenAlexW2483910514MaRDI QIDQ5714755

Marco Maratea, Alessandro Armando, Claudio Castellini, Enrico Giunchiglia

Publication date: 16 December 2005

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

Full work available at URL: https://doi.org/10.1007/11527695

Mathematics Subject Classification ID

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

Related Items (9)

Modelling and solving temporal reasoning as propositional satisfiability ⋮ Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005) ⋮ The SAT-based approach to separation logic ⋮ M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures ⋮ Bounded Model Checking of Analog and Mixed-Signal Circuits Using an SMT Solver ⋮ Efficient theory combination via Boolean search ⋮ Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates ⋮ Theory decision by decomposition ⋮ Rewrite-Based Decision Procedures

Uses Software

• Chaff

This page was built for publication: Theory and Applications of Satisfiability Testing