Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
type: Item
instance of: scholarly article
title: Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis
zbMATH Open document ID: 1192.68627
author: Roberto Bruttomesso
author: Alessandro Cimatti
author: Anders Franzén
author: Alberto Griggio
author: Roberto Sebastiani
published in: Annals of Mathematics and Artificial Intelligence
publication date: 2009-11-16T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5633344
Wikidata QID: Q62041259
describes a project that uses: Zapato
describes a project that uses: Yices
describes a project that uses: SIMPLIFY
describes a project that uses: MathSAT
describes a project that uses: ICS
describes a project that uses: CVC Lite
describes a project that uses: cvc3
MaRDI profile type: Publication
full work available at URL: s10472-009-9152-7
OpenAlex ID: W2276124093
cites work: Computer Aided Verification
cites work: Splitting on Demand in SAT Modulo Theories
cites work: Q4737130
cites work: Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
cites work: Encoding RTL constructs for \textsc{MathSAT}: a preliminary report
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Efficient theory combination via Boolean search
cites work: Delayed Theory Combination vs. Nelson-Oppen for Satisfiability Modulo Theories: A Comparative Analysis
cites work: Fast and Flexible Difference Constraint Propagation for DPLL(T)
cites work: Model-based theory combination
cites work: Automated Reasoning
cites work: Simplify: a theorem prover for program checking
cites work: Q4052071
cites work: Q4553256
cites work: Logic for Programming, Artificial Intelligence, and Reasoning
cites work: Model-theoretic methods in combined constraint satisfiability
cites work: Frontiers of Combining Systems
cites work: Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
cites work: Combined Satisfiability Modulo Parametric Theories
cites work: Simplification by Cooperating Decision Procedures
cites work: Q3408132
cites work: Complexity, convexity and combinations of theories
cites work: Q4808733
cites work: Q3506045
cites work: A Practical Decision Procedure for Arithmetic with Function Symbols
cites work: Deciding Combinations of Theories
cites work: Q4385439
cites work: Unions of non-disjoint theories and combinations of satisfiability procedures
cites work: Combining nonstably infinite theories
cites work: Q4412868
cites work: Q4737128
cites work: Q4804883
DOI: 10.1007/S10472-009-9152-7
description: scientific article; zbMATH DE number 5633344