Equivalence models for quantified Boolean formulas

DOI10.1007/11527695_18MaRDI QIDQ5714753zbMATH OpenOpenAlexFDO

Authors Hans Kleine Büning, Xishun Zhao

Publication date 16 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11527695

zbMATH Keywords

complexityequivalenceequivalence modelmodel checkingQuantified Boolean formulasatisfiability

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Boolean functions as models for quantified Boolean formulas
• On models for quantified Boolean formulas
• Model-equivalent reductions
• On the restricted equivalence for subclasses of propositional logic
• Mathematical Foundations of Computer Science 2003

Cited in

(13)

• A formalisation of consistent consequence for Boolean equation systems
• Boolean functions as models for quantified Boolean formulas
• scientific article; zbMATH DE number 5719280 (Why is no real title available?)
• Equivalence and isomorphism for Boolean constraint satisfaction
• On quantifying literals in Boolean logic and its applications to explainable AI
• Theory and Applications of Satisfiability Testing
• Nested Boolean functions as models for quantified Boolean formulas
• Mathematical Foundations of Computer Science 2003
• On models for quantified Boolean formulas
• Model-equivalent reductions
• Quantifier rewriting and equivalence models for quantified Horn formulas
• Refined notions of QBF equivalences
• Models and quantifier elimination for quantified Horn formulas

This page was built for publication: Equivalence models for quantified Boolean formulas

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