Boolean functions as models for quantified Boolean formulas

DOI10.1007/s10817-007-9067-0zbMath1126.03015OpenAlexW2044916592MaRDI QIDQ2642467

Hans Kleine Büning, Zhao, Xishun, K. Subramani and Vahan Mkrtchyan

Publication date: 17 August 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-007-9067-0

zbMATH Keywords

complexitypropositional logicmodel checkingBoolean functionsatisfiabilityquantified Boolean formula

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Classical propositional logic (03B05) Boolean functions (06E30)

Related Items (5)

Quantified maximum satisfiability ⋮ Solution validation and extraction for QBF preprocessing ⋮ From LTL to unambiguous Büchi automata via disambiguation of alternating automata ⋮ Lost in translation: language independence in propositional logic -- application to belief change ⋮ A Unified Framework for Certificate and Compilation for QBF

Uses Software

• QUBE

Cites Work

• The intractability of resolution
• The polynomial-time hierarchy
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Resolution for quantified Boolean formulas
• Theory and Applications of Satisfiability Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Boolean functions as models for quantified Boolean formulas