Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
From MaRDI portal
Publication:1037399
DOI10.1007/s10472-009-9152-7zbMath1192.68627OpenAlexW2276124093WikidataQ62041259 ScholiaQ62041259MaRDI QIDQ1037399
Roberto Sebastiani, Alberto Griggio, Alessandro Cimatti, Anders Franzen, Roberto Bruttomesso
Publication date: 16 November 2009
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-009-9152-7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Sharing Is Caring: Combination of Theories ⋮ Satisfiability Modulo Theories ⋮ New techniques for linear arithmetic: cubes and equalities ⋮ Constraint solving for finite model finding in SMT solvers ⋮ Being careful about theory combination ⋮ A posthumous contribution by Larry Wos: excerpts from an unpublished column
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model-theoretic methods in combined constraint satisfiability
- Combining nonstably infinite theories
- Complexity, convexity and combinations of theories
- Unions of non-disjoint theories and combinations of satisfiability procedures
- Efficient theory combination via Boolean search
- Model-based Theory Combination
- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
- Simplify: a theorem prover for program checking
- Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
- Deciding Combinations of Theories
- Simplification by Cooperating Decision Procedures
- A Practical Decision Procedure for Arithmetic with Function Symbols
- Automated Reasoning
- Computer Aided Verification
- Computer Aided Verification
- Computer Aided Verification
- Splitting on Demand in SAT Modulo Theories
- Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis
- Frontiers of Combining Systems
- Frontiers of Combining Systems
- Frontiers of Combining Systems
- Tools and Algorithms for the Construction and Analysis of Systems
- Logic for Programming, Artificial Intelligence, and Reasoning
- Computer Aided Verification
- Computer Aided Verification
- Fast and Flexible Difference Constraint Propagation for DPLL(T)
- Combined Satisfiability Modulo Parametric Theories
- Computer Aided Verification
This page was built for publication: Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
