On Variable-inactivity and Polynomial Formula-Satisfiability Procedures
From MaRDI portal
(Redirected from Publication:5450569)
Recommendations
Cited in
(20)- Theory decision by decomposition
- Polynomial constraints and unsat cores in \textsc{Tarski}
- Variant-based decidable satisfiability in initial algebras with predicates
- On interpolation in automated theorem proving
- Metalevel algorithms for variant satisfiability
- Rewrite-based decision procedures
- Rewrite-based satisfiability procedures for recursive data structures
- Interpolation systems for ground proofs in automated deduction: a survey
- Modular termination and combinability for superposition modulo counter arithmetic
- ${\mathcal{T}}$ -Decision by Decomposition
- Satisfiability Procedures for Combination of Theories Sharing Integer Offsets
- Data structures with arithmetic constraints: A non-disjoint combination
- scientific article; zbMATH DE number 140415 (Why is no real title available?)
- On deciding satisfiability by theorem proving with speculative inferences
- An instantiation scheme for satisfiability modulo theories
- Variant-Based Satisfiability in Initial Algebras
- Canonical ground Horn theories
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving
- New results on rewrite-based satisfiability procedures
- Frontiers of Combining Systems
This page was built for publication: On Variable-inactivity and Polynomial Formula-Satisfiability Procedures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5450569)
