Partial quantifier elimination and property generation

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

Eugene Goldberg

Publication date: 12 January 2024

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantifier elimination by dependency sequents
• New methods for 3-SAT decision and worst-case analysis
• Software for Quantifier Elimination in Propositional Logic
• SAT-Based Model Checking without Unrolling
• Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
• Quantifier Elimination via Functional Composition
• Graph-Based Algorithms for Boolean Function Manipulation
• Theory and Applications of Satisfiability Testing
• Synthesis of Circular Compositional Program Proofs via Abduction
• Computer Aided Verification
• Incremental determinization for quantifier elimination and functional synthesis

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