Boolean functions as models for quantified Boolean formulas

DOI10.1007/S10817-007-9067-0zbMATH Open1126.03015OpenAlexW2044916592MaRDI QIDQ2642467FDOQ2642467

Authors: Hans Kleine Büning, K. Subramani, Xishun Zhao 

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

Recommendations

• Logic versus Approximation
• Theory and Applications of Satisfiability Testing
• Nested Boolean functions as models for quantified Boolean formulas
• Theory and Applications of Satisfiability Testing
• The complexity of model checking for Boolean formulas

zbMATH Keywords

complexitymodel checkingBoolean functionsatisfiabilityquantified Boolean formulapropositional logic

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Resolution for quantified Boolean formulas
• Title not available (Why is that?)
• Title not available (Why is that?)
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• The polynomial-time hierarchy
• The intractability of resolution
• An algorithm to evaluate quantified Boolean formulae and its experimental evaluation
• Theory and Applications of Satisfiability Testing

Cited In (21)

• Title not available (Why is that?)
• Quantified maximum satisfiability
• Database Support for Data Mining Applications
• Logic versus Approximation
• From LTL to unambiguous Büchi automata via disambiguation of alternating automata
• Function representation of the Boolean-valued universe
• Title not available (Why is that?)
• Encoding nested Boolean functions as quantified Boolean formulas
• Boolean Models and Simultaneous Inequalities
• Function representation of the Boolean-valued universe
• Boolean valued models and incomplete specifications
• The complexity of model checking for Boolean formulas
• A Unified Framework for Certificate and Compilation for QBF
• Solution validation and extraction for QBF preprocessing
• Title not available (Why is that?)
• Lost in translation: language independence in propositional logic -- application to belief change
• Alternative definitions of Boolean functions and relations
• Nested Boolean functions as models for quantified Boolean formulas
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Minimal False Quantified Boolean Formulas

Uses Software

• QUBE

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

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