The following pages link to Theory decision by decomposition (Q1041591):
Displaying 10 items.
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- An instantiation scheme for satisfiability modulo theories (Q438578) (← links)
- Semantically-guided goal-sensitive reasoning: inference system and completeness (Q1707598) (← links)
- SMELS: satisfiability modulo equality with lazy superposition (Q2351265) (← links)
- On First-Order Model-Based Reasoning (Q2945706) (← links)
- Automatic Decidability: A Schematic Calculus for Theories with Counting Operators (Q2958392) (← links)
- Modular Termination and Combinability for Superposition Modulo Counter Arithmetic (Q3172895) (← links)
- Quantifier-Free Equational Logic and Prime Implicate Generation (Q3454103) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving (Q5191095) (← links)