Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
Authors:
- Robert NieuwenhuisRNRobert Nieuwenhuis
- Albert OliverasAOAlbert Oliveras
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 23-46
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints2005
- Efficient Satisfiability Modulo Theories via Delayed Theory CombinationLecture Notes in Computer Science, 2005
- An Incremental and Layered Procedure for the Satisfiability of Linear Arithmetic LogicLecture Notes in Computer Science, 2005
- CVC Lite: A New Implementation of the Cooperating Validity Checker2004
- Zapato: Automatic Theorem Proving for Predicate Abstraction RefinementLecture Notes in Computer Science, 2004
- A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions2002
- SAT-Based Procedures for Temporal ReasoningLecture Notes in Computer Science, 2000
- Timed Automata1999
- Validity checking for combinations of theories with equality1996
- Automatic verification of pipelined microprocessor control1994