Strong inconsistency
From MaRDI portal
Publication:2321259
DOI10.1016/J.ARTINT.2018.11.002zbMATH Open1478.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) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cites Work
- The complexity of facets resolved
- Nonmonotonic reasoning, preferential models and cumulative logics
- 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
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Axiom Pinpointing in General Tableaux
- Consistent subsets of inconsistent systems: structure and behaviour
- An abductive framework for computing knowledge base updates
- Inconsistency Tolerance
- Strongly equivalent logic programs
- The complexity of computing the permanent
- What does a conditional knowledge base entail?
- A theory of diagnosis from first principles
- Fast, flexible MUS enumeration
- Characterizing strong equivalence for argumentation frameworks
- Finding explanations of inconsistency in multi-context systems
- A logic for default reasoning
- Rational Closure for Defeasible Description Logics
- A non-monotonic description logic for reasoning about typicality
- Graph theoretical structures in logic programs and default theories
- Inconsistency tolerance.
- Logic programming and knowledge representation---The A-Prolog perspective
- Debugging incoherent terminologies
- An Introduction to Description Logic
- On Semantic Update Operators for Answer-Set Programs
- Minimal False Quantified Boolean Formulas
- Understanding the complexity of axiom pinpointing in lightweight description logics
- Measuring Inconsistency in Answer Set Programs
- A novel SAT-based approach to model based diagnosis
- Measuring Disagreement in Argumentation Graphs
- Localising iceberg inconsistencies
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Anytime answer set optimization via unsatisfiable core shrinking
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (9)
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space
- ASP and subset minimality: enumeration, cautious reasoning and MUSes
- Inconsistency Measurement
- Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU
- Handling and measuring inconsistency in non-monotonic logics
- Enumeration of minimal models and MUSes in WASP
- Computing smallest MUSes of quantified Boolean formulas
- Inference to the stable explanations
Uses Software
Recommendations
- Contradictions, from consistency to inconsistency 👍 👎
- Inconsistency without contradiction 👍 👎
- INCOHERENCE AND INCONSISTENCY 👍 👎
- Incompatibility between stability and consistency 👍 👎
- Strong Ambiguity 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Strong inconsistency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321259)
