scientific article; zbMATH DE number 5139037

MaRDI QIDQ3429018zbMATH OpenFDO

Authors Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis

Publication date 30 March 2007

zbMATH Keywords

automated reasoning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Knowledge representation (68T30)

Recommendations

• scientific article; zbMATH DE number 3845566
• Proof Complexity of Quantified Boolean Logic — A Survey
• Computational complexity of quantified Boolean formulas with fixed maximal deficiency
• scientific article; zbMATH DE number 4075035
• On the complexity of propositional calculus formulae
• scientific article; zbMATH DE number 5263419
• An upper bound for the circuit complexity of existentially quantified Boolean formulas
• A satisfiability procedure for quantified Boolean formulae
• On the complexity of realization of Boolean functions by formulas
• scientific article; zbMATH DE number 2203952

Cited in

(9)

• On propositional definability
• Computing smallest MUSes of quantified Boolean formulas
• Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages
• A Unified Framework for Certificate and Compilation for QBF
• On quantifying literals in Boolean logic and its applications to explainable AI
• Tractable QBF by knowledge compilation
• Automata, Languages and Programming
• Computational complexity of quantified Boolean formulas with fixed maximal deficiency
• An upper bound for the circuit complexity of existentially quantified Boolean formulas

Describes a project that uses

Uses Software

• Quaffle
• Qprop

This page was built for publication:

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