Quantifier Elimination and Provers Integration
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1215478 (Why is no real title available?)
- scientific article; zbMATH DE number 1140674 (Why is no real title available?)
- scientific article; zbMATH DE number 1552532 (Why is no real title available?)
- scientific article; zbMATH DE number 1848313 (Why is no real title available?)
- scientific article; zbMATH DE number 2090084 (Why is no real title available?)
- A general setting for flexibly combining and augmenting decision procedures
- Algebraic and model theoretic techniques for fusion decidability in modal logics
- Complexity, convexity and combinations of theories
- Cooperation of background reasoners in theory reasoning by residue sharing
- Model theory.
- Model-companions and definability in existentially complete structures
- Paramodulation-based theorem proving
- Reasoning About Recursively Defined Data Structures
- Sheaves, games, and model completions. A categorical approach to nonclassical propositional logics
- Simplification by Cooperating Decision Procedures
- The computational complexity of logical theories
- Unions of non-disjoint theories and combinations of satisfiability procedures
Cited in
(7)- Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type
- Combining nonstably infinite theories
- Combining non-stably infinite theories
- Fixed-Point Elimination in the Intuitionistic Propositional Calculus
- Verifying Mixed Real-Integer Quantifier Elimination
- Satisfiability solving and model generation for quantified first-order logic formulas
- Combining sets with cardinals
This page was built for publication: Quantifier Elimination and Provers Integration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916219)
