Software for quantifier elimination in propositional logic

DOI10.1007/978-3-662-44199-2_45MaRDI QIDQ2879137zbMATH OpenOpenAlexFDO

Authors Eugene Goldberg, Panagiotis Manolios

Publication date 8 September 2014

Published in Mathematical Software – ICMS 2014 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44199-2_45

zbMATH Keywords

dependency sequentspropositional logicquantifier elimination

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04) Classical propositional logic (03B05) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• Quantifier elimination by dependency sequents
• New approaches to Boolean quantifier elimination
• Quantifier Elimination via Functional Composition
• Contributions to the theory of practical quantified Boolean formula solving
• Clause elimination for SAT and QSAT

Cited in

(6)

• A mechanism of uncovering of quantifiers in Boolean variables
• Parametric quantified SAT solving
• Quantifier Elimination via Functional Composition
• Quantifier elimination by dependency sequents
• New approaches to Boolean quantifier elimination
• Partial quantifier elimination and property generation

This page was built for publication: Software for quantifier elimination in propositional logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2879137)