Pages that link to "Item:Q5191095"
From MaRDI portal
The following pages link to On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving (Q5191095):
Displaying 8 items.
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Superposition as a decision procedure for timed automata (Q1949086) (← links)
- A unifying splitting framework (Q2055869) (← links)
- Modular Termination and Combinability for Superposition Modulo Counter Arithmetic (Q3172895) (← links)
- Combining Instance Generation and Resolution (Q3655208) (← links)
- SAT-Inspired Eliminations for Superposition (Q5875949) (← links)
- Unifying splitting (Q6103590) (← links)
