Computing smallest MUSes of quantified Boolean formulas
From MaRDI portal
Publication:2694579
DOI10.1007/978-3-031-15707-3_23OpenAlexW4293179750MaRDI QIDQ2694579
Matti Järvisalo, Jeremias Berg, Jere Mustonen, Andreas Niskanen
Publication date: 4 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-031-15707-3_23
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving QBF with counterexample guided refinement
- Quantified maximum satisfiability
- A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
- A theory of diagnosis from first principles
- The complexity of facets resolved
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Strong explanations for nonmonotonic reasoning
- Handling and measuring inconsistency in non-monotonic logics
- Acceptance in incomplete argumentation frameworks
- Strong inconsistency
- DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL
- A QBF-based formalization of abstract argumentation semantics
- Redundancy in logic. I: CNF propositional formulae
- Reasoning about strong inconsistency in ASP
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- Abduction in argumentation frameworks
- If Nothing Is Accepted -- Repairing Argumentation Frameworks
- Experiments with Reduction Finding
