Pages that link to "Item:Q3524998"
From MaRDI portal
The following pages link to Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL (Q3524998):
Displaying 16 items.
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999) (← links)
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs (Q832719) (← links)
- Formalization and implementation of modern SAT solvers (Q839035) (← links)
- Deciding effectively propositional logic using DPLL and substitution sets (Q972432) (← links)
- Delayed theory combination vs. Nelson-Oppen for satisfiability modulo theories: a comparative analysis (Q1037399) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Conflict-driven satisfiability for theory combination: transition system and completeness (Q2303254) (← links)
- Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint (Q2398511) (← links)
- Satisfiability Modulo Theories (Q3176369) (← links)
- Deciding Effectively Propositional Logic Using DPLL and Substitution Sets (Q3541720) (← links)
- Constraint solving for finite model finding in SMT solvers (Q4593094) (← links)
- (Q5094139) (← links)
- Ground Interpolation for Combined Theories (Q5191102) (← links)
- Cutting to the Chase Solving Linear Integer Arithmetic (Q5200035) (← links)
- A proof system for graph (non)-isomorphism verification (Q5883756) (← links)