Boolean functions as models for quantified Boolean formulas
From MaRDI portal
Publication:2642467
DOI10.1007/s10817-007-9067-0zbMath1126.03015MaRDI 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
complexity; propositional logic; model checking; Boolean function; satisfiability; quantified Boolean formula
68Q25: Analysis of algorithms and problem complexity
68Q60: Specification and verification (program logics, model checking, etc.)
03B05: Classical propositional logic
06E30: Boolean functions
Related Items
Quantified maximum satisfiability, Lost in translation: language independence in propositional logic -- application to belief change, From LTL to unambiguous Büchi automata via disambiguation of alternating automata, Solution validation and extraction for QBF preprocessing, A Unified Framework for Certificate and Compilation for QBF
Uses Software
Cites Work