The following pages link to Engineering DPLL(T) + Saturation (Q3541724):
Displaying 19 items.
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- Adding decision procedures to SMT solvers using axioms with triggers (Q287384) (← links)
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- An instantiation scheme for satisfiability modulo theories (Q438578) (← links)
- Quantifier simplification by unification in SMT (Q831945) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- Semantically-guided goal-sensitive reasoning: inference system and completeness (Q1707598) (← links)
- Superposition as a decision procedure for timed automata (Q1949086) (← links)
- Deciding the Bernays-Schoenfinkel fragment over bounded difference constraints by simple clause learning over theories (Q2234101) (← links)
- Incremental search for conflict and unit instances of quantified formulas with E-matching (Q2234102) (← links)
- SMELS: satisfiability modulo equality with lazy superposition (Q2351265) (← links)
- Fault-Tolerant Aggregate Signatures (Q2798782) (← links)
- Superposition Modulo Non-linear Arithmetic (Q3172887) (← links)
- Congruence Closure with Free Variables (Q3303931) (← links)
- Superposition Modulo Linear Arithmetic SUP(LA) (Q3655193) (← links)
- Data Structures with Arithmetic Constraints: A Non-disjoint Combination (Q3655209) (← links)
- Simple and Efficient Clause Subsumption with Feature Vector Indexing (Q4913860) (← links)
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving (Q5191095) (← links)
- Combinable Extensions of Abelian Groups (Q5191096) (← links)
