Pages that link to "Item:Q5277822"
From MaRDI portal
The following pages link to New results on rewrite-based satisfiability procedures (Q5277822):
Displayed 19 items.
- Interpolation systems for ground proofs in automated deduction: a survey (Q287275) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- Combination of convex theories: modularity, deduction completeness, and explanation (Q1041593) (← links)
- Superposition as a decision procedure for timed automata (Q1949086) (← links)
- Superposition decides the first-order logic fragment over ground theories (Q1949088) (← links)
- On interpolation in automated theorem proving (Q2352502) (← links)
- Modular Termination and Combinability for Superposition Modulo Counter Arithmetic (Q3172895) (← links)
- Quantifier-Free Equational Logic and Prime Implicate Generation (Q3454103) (← links)
- A Polite Non-Disjoint Combination Method: Theories with Bridging Functions Revisited (Q3454111) (← links)
- Engineering DPLL(T) + Saturation (Q3541724) (← links)
- Satisfiability Procedures for Combination of Theories Sharing Integer Offsets (Q3617773) (← links)
- Superposition Modulo Linear Arithmetic SUP(LA) (Q3655193) (← links)
- Data Structures with Arithmetic Constraints: A Non-disjoint Combination (Q3655209) (← links)
- Superposition for Bounded Domains (Q4913861) (← links)
- Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving (Q5191095) (← links)
- Combinable Extensions of Abelian Groups (Q5191096) (← links)
- Heaps and Data Structures: A Challenge for Automated Provers (Q5200023) (← links)