Computing smallest MUSes of quantified Boolean formulas
From MaRDI portal
Recommendations
- The complexity of Boolean formula minimization
- The Complexity of Boolean Formula Minimization
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency
- On approximability of Boolean formula minimization
- Contributions to the theory of practical quantified Boolean formula solving
- Publication:4828947
- The Minimization Problem for Boolean Formulas
- The Complexity of Very Simple Boolean Formulas with Applications
- On the complexity of Boolean functions with small number of ones
- Publication:3429018
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- A QBF-based formalization of abstract argumentation semantics
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- A theory of diagnosis from first principles
- Abduction in argumentation frameworks
- Acceptance in incomplete argumentation frameworks
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- Experiments with reduction finding
- Explaining non-acceptability in abstract argumentation
- Handling and measuring inconsistency in non-monotonic logics
- If nothing is accepted -- repairing argumentation frameworks
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Quantified maximum satisfiability
- Reasoning about strong inconsistency in ASP
- Redundancy in logic. I: CNF propositional formulae
- Solving QBF with counterexample guided refinement
- Strong explanations for nonmonotonic reasoning
- Strong inconsistency
- The complexity of facets resolved
This page was built for publication: Computing smallest MUSes of quantified Boolean formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2694579)
