Partial quantifier elimination and property generation

DOI10.1007/978-3-031-37703-7_6zbMATH Open1545.68071MaRDI QIDQ6535530FDOQ6535530

Authors: Eugene Goldberg 

Publication date: 12 January 2024

Recommendations

• Software for quantifier elimination in propositional logic
• Fast DQBF Refutation
• New approaches to Boolean quantifier elimination
• A satisfiability procedure for quantified Boolean formulae
• Verification of partial designs using incremental QBF

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Quantifier elimination, model completeness, and related topics (03C10) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• Theory and Applications of Satisfiability Testing
• Graph-Based Algorithms for Boolean Function Manipulation
• Title not available (Why is that?)
• Interpolation and SAT-based model checking.
• SAT-Based Model Checking without Unrolling
• Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
• Synthesis of circular compositional program proofs via abduction
• New methods for 3-SAT decision and worst-case analysis
• Title not available (Why is that?)
• Quantifier Elimination via Functional Composition
• Title not available (Why is that?)
• Quantifier elimination by dependency sequents
• Software for quantifier elimination in propositional logic
• Incremental determinization for quantifier elimination and functional synthesis

This page was built for publication: Partial quantifier elimination and property generation

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