New approaches to Boolean quantifier elimination

DOI10.1145/2016567.2016595MaRDI QIDQ5175308zbMATH OpenOpenAlexFDO

Authors Christoph Zengler, Andreas Kübler, Wolfgang Küchlin

Publication date 20 February 2015

Published in ACM Communications in Computer Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2016567.2016595

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Quantifier elimination by dependency sequents
• Software for quantifier elimination in propositional logic
• Quantifier Elimination via Functional Composition
• A satisfiability procedure for quantified Boolean formulae
• scientific article; zbMATH DE number 5719280

Cited in

(9)

• A mechanism of uncovering of quantifiers in Boolean variables
• Software for quantifier elimination in propositional logic
• Quantifier Elimination via Functional Composition
• Quantifier elimination by dependency sequents
• On quantifying literals in Boolean logic and its applications to explainable AI
• Theory and Applications of Satisfiability Testing
• New Minimal Linear Inferences in Boolean Logic Independent of Switch and Medial
• Fast approximations of quantifier elimination
• Partial quantifier elimination and property generation

This page was built for publication: New approaches to Boolean quantifier elimination

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