Henkin quantifiers and Boolean formulae

DOI10.1007/978-3-642-31612-8_11MaRDI QIDQ2843328zbMATH OpenOpenAlexFDO

Authors Valeriy Balabanov, Hui-Ju Katherine Chiang, Jie-Hong R. Jiang

Publication date 12 August 2013

Published in Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31612-8_11

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Logic with extra quantifiers and operators (03C80)

Recommendations

• Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
• Dependency Quantified Horn Formulas: Models and Complexity
• Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications
• Fast DQBF Refutation
• Solving dependency quantified Boolean formulas using quantifier localization

Cited in

(7)

• Henkin quantifiers and complete problems
• Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
• scientific article; zbMATH DE number 1163935 (Why is no real title available?)
• scientific article; zbMATH DE number 2149377 (Why is no real title available?)
• Complexity of fixed-size bit-vector logics
• Dependency Quantified Horn Formulas: Models and Complexity
• Apartness and distinguishing formulas in Hennessy-Milner logic

This page was built for publication: Henkin quantifiers and Boolean formulae

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