Quantifier Elimination via Functional Composition

DOI10.1007/978-3-642-02658-4_30MaRDI QIDQ3636874zbMATH OpenOpenAlexFDO

Authors Jie-Hong R. Jiang

Publication date 30 June 2009

Published in Computer Aided Verification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02658-4_30

Mathematics Subject Classification ID

Quantifier elimination, model completeness, and related topics (03C10) Interpolation, preservation, definability (03C40) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Quantifier elimination by dependency sequents
• Quantifier elimination for a class of exponential polynomial formulas
• New approaches to Boolean quantifier elimination
• Software for quantifier elimination in propositional logic
• Formula Simplification for Real Quantifier Elimination Using Geometric Invariance

Cited in

(12)

• Boolean functional synthesis: hardness and practical algorithms
• Solving dependency quantified Boolean formulas using quantifier localization
• Software for quantifier elimination in propositional logic
• Towards Parallel Boolean Functional Synthesis
• Quantifier elimination by dependency sequents
• Quantifier elimination for a class of exponential polynomial formulas
• On quantifying literals in Boolean logic and its applications to explainable AI
• New approaches to Boolean quantifier elimination
• Functional synthesis via input-output separation
• Incremental determinization for quantifier elimination and functional synthesis
• Partial quantifier elimination and property generation
• Tractable representations for Boolean functional synthesis

This page was built for publication: Quantifier Elimination via Functional Composition

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