Satisfiability modulo theories and assignments
From MaRDI portal
Publication:2405239
DOI10.1007/978-3-319-63046-5_4zbMATH Open1468.68193OpenAlexW2729127299MaRDI QIDQ2405239FDOQ2405239
Authors: Maria Paola Bonacina, Stéphane Graham-Lengrand, Natarajan Shankar 
Publication date: 22 September 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-63046-5_4
Recommendations
- Conflict-driven satisfiability for theory combination: transition system and completeness
- Theory combination: beyond equality sharing
- From Propositional Satisfiability to Satisfiability Modulo Theories
- Unions of non-disjoint theories and combinations of satisfiability procedures
- scientific article; zbMATH DE number 1140675
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in computer science (03B70)
Cited In (16)
- An experiment with satisfiability modulo SAT
- Solving bitvectors with MCSAT: explanations from bits and pieces
- Theory combination: beyond equality sharing
- Reasoning about vectors: satisfiability modulo a theory of sequences
- Conflict-driven satisfiability for theory combination: transition system and completeness
- A framework for satisfiability modulo theories
- Satisfiability modulo transcendental functions via incremental linearization
- Unifying splitting
- Solving constraint satisfaction problems with SAT modulo theories
- Modal Satisfiability via SMT Solving
- Satisfiability on mixed instances
- Generalized Davis-Putnam and satisfiability problems in mathematics
- A conflict-driven solving procedure for poly-power constraints
- SAT-Inspired Eliminations for Superposition
- ALASCA: reasoning in quantified linear arithmetic
- A unifying splitting framework
This page was built for publication: Satisfiability modulo theories and assignments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2405239)
