Strong inconsistency
From MaRDI portal
Publication:2321259
DOI10.1016/j.artint.2018.11.002zbMath1478.68362OpenAlexW4210617806MaRDI QIDQ2321259
Matthias Thimm, Gerhard Brewka, Markus Ulbricht
Publication date: 28 August 2019
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2018.11.002
Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Knowledge representation (68T30)
Related Items
Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU, Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks, ASP and subset minimality: enumeration, cautious reasoning and MUSes, Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space, Enumeration of minimal models and MUSes in WASP, Inference to the stable explanations, Computing smallest MUSes of quantified Boolean formulas, Handling and measuring inconsistency in non-monotonic logics, Inconsistency Measurement
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast, flexible MUS enumeration
- A non-monotonic description logic for reasoning about typicality
- Characterizing strong equivalence for argumentation frameworks
- Finding explanations of inconsistency in multi-context systems
- The complexity of computing the permanent
- Graph theoretical structures in logic programs and default theories
- A theory of diagnosis from first principles
- The complexity of facets resolved
- A logic for default reasoning
- Nonmonotonic reasoning, preferential models and cumulative logics
- What does a conditional knowledge base entail?
- Logic programming and knowledge representation---The A-Prolog perspective
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Inconsistency tolerance.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- On the computational cost of disjunctive logic programming: Propositional case
- Localising iceberg inconsistencies
- Debugging incoherent terminologies
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Measuring Inconsistency in Answer Set Programs
- A Novel SAT-Based Approach to Model Based Diagnosis
- An Introduction to Description Logic
- On Semantic Update Operators for Answer-Set Programs
- Axiom Pinpointing in General Tableaux
- Consistent subsets of inconsistent systems: structure and behaviour
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Anytime answer set optimization via unsatisfiable core shrinking
- An abductive framework for computing knowledge base updates
- Rational Closure for Defeasible Description Logics
- Measuring Disagreement in Argumentation Graphs
- Inconsistency Tolerance
- Strongly equivalent logic programs
- Minimal False Quantified Boolean Formulas
