Pages that link to "Item:Q5450569"
From MaRDI portal
The following pages link to On Variable-inactivity and Polynomial Formula-Satisfiability Procedures (Q5450569):
Displaying 15 items.
- Interpolation systems for ground proofs in automated deduction: a survey (Q287275) (← links)
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- An instantiation scheme for satisfiability modulo theories (Q438578) (← links)
- Theory decision by decomposition (Q1041591) (← links)
- Polynomial constraints and unsat cores in \textsc{Tarski} (Q1662298) (← links)
- Variant-based decidable satisfiability in initial algebras with predicates (Q1671164) (← links)
- On interpolation in automated theorem proving (Q2352502) (← links)
- Rewrite-based decision procedures (Q2864358) (← links)
- Rewrite-based satisfiability procedures for recursive data structures (Q2864524) (← links)
- Modular Termination and Combinability for Superposition Modulo Counter Arithmetic (Q3172895) (← links)
- Satisfiability Procedures for Combination of Theories Sharing Integer Offsets (Q3617773) (← links)
- Data Structures with Arithmetic Constraints: A Non-disjoint Combination (Q3655209) (← links)
- Variant-Based Satisfiability in Initial Algebras (Q4686604) (← links)
- Canonical Ground Horn Theories (Q4916071) (← links)
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving (Q5191095) (← links)