Nested Boolean functions as models for quantified Boolean formulas

DOI10.1007/978-3-642-39071-5_20zbMATH Open1390.68337OpenAlexW151780725MaRDI QIDQ5326469FDOQ5326469

Authors: Hans Kleine Büning, Uwe Bubeck 

Publication date: 5 August 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-39071-5_20

Recommendations

• Encoding nested Boolean functions as quantified Boolean formulas
• Boolean functions as models for quantified Boolean formulas
• Logic versus Approximation
• Publication:4489064
• Theory and Applications of Satisfiability Testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05)

Cited In (10)

• Title not available (Why is that?)
• The possibilistic Horn non-clausal knowledge bases
• Logic versus Approximation
• Encoding nested Boolean functions as quantified Boolean formulas
• Recognition of Nested Gates in CNF Formulas
• Tackling universal properties of minimal trap spaces of Boolean networks
• Learning Boolean specifications
• Boolean functions as models for quantified Boolean formulas
• Title not available (Why is that?)
• Theory and Applications of Satisfiability Testing

This page was built for publication: Nested 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 Q5326469)