Partial quantifier elimination and property generation
From MaRDI portal
Publication:6535530
DOI10.1007/978-3-031-37703-7_6zbMATH Open1545.68071MaRDI QIDQ6535530FDOQ6535530
Publication date: 12 January 2024
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
- Computer Aided Verification
- 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
- Quantifier Elimination via Functional Composition
- Quantifier elimination by dependency sequents
- Software for Quantifier Elimination in Propositional Logic
- Incremental determinization for quantifier elimination and functional synthesis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
