Computing smallest MUSes of quantified Boolean formulas (Q2694579): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-031-15707-3_23 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4293179750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QBF-based formalization of abstract argumentation semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceptance in incomplete argumentation frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong inconsistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong explanations for nonmonotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantified maximum satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving QBF with counterexample guided refinement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments with Reduction Finding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in logic. I: CNF propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API / rank
 
Normal rank
Property / cites work
 
Property / cites work: DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about strong inconsistency in ASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of diagnosis from first principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abduction in argumentation frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4999292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: If Nothing Is Accepted -- Repairing Argumentation Frameworks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handling and measuring inconsistency in non-monotonic logics / rank
 
Normal rank

Latest revision as of 20:19, 31 July 2024

scientific article
Language Label Description Also known as
English
Computing smallest MUSes of quantified Boolean formulas
scientific article

    Statements

    Computing smallest MUSes of quantified Boolean formulas (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2023
    0 references
    quantified Boolean formulas
    0 references
    minimum unsatisfiability
    0 references
    abstract argumentation
    0 references
    strong explanations
    0 references

    Identifiers