Strong inconsistency
type: Item
instance of: scholarly article
title: Strong inconsistency
zbMATH Open document ID: 1478.68362
author: Gerhard Brewka
author: Matthias Thimm
author: Markus Ulbricht
published in: Artificial Intelligence
publication date: 2019-08-28T00:00:00Z
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 7099173
zbMATH Keywords: nonmonotonic reasoning
zbMATH Keywords: inconsistency handling
zbMATH Keywords: minimal inconsistent subsets
zbMATH Keywords: computational complexity
describes a project that uses: Swoop
MaRDI profile type: Publication
full work available at URL: j.artint.2018.11.002
OpenAlex ID: W4210617806
cites work: Model enumeration in propositional circumscription via unsatisfiable core analysis
cites work: Anytime answer set optimization via unsatisfiable core shrinking
cites work: Measuring Disagreement in Argumentation Graphs
cites work: An Introduction to Description Logic
cites work: Axiom Pinpointing in General Tableaux
cites work: Inconsistency tolerance.
cites work: Q3586991
cites work: Consistent subsets of inconsistent systems: structure and behaviour
cites work: Q3198878
cites work: Minimal False Quantified Boolean Formulas
cites work: Rational Closure for Defeasible Description Logics
cites work: Localising iceberg inconsistencies
cites work: Graph theoretical structures in logic programs and default theories
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Finding explanations of inconsistency in multi-context systems
cites work: On the computational cost of disjunctive logic programming: Propositional case
cites work: Logic programming and knowledge representation---The A-Prolog perspective
cites work: Q3983043
cites work: A non-monotonic description logic for reasoning about typicality
cites work: Q5226732
cites work: Inconsistency Tolerance
cites work: Q4576231
cites work: Nonmonotonic reasoning, preferential models and cumulative logics
cites work: What does a conditional knowledge base entail?
cites work: Fast, flexible MUS enumeration
cites work: Algorithms for computing minimal unsatisfiable subsets of constraints
cites work: Strongly equivalent logic programs
cites work: A novel SAT-based approach to model based diagnosis
cites work: Q4296748
cites work: Q4789444
cites work: Characterizing strong equivalence for argumentation frameworks
cites work: Q4298260
cites work: The complexity of facets resolved
cites work: Understanding the complexity of axiom pinpointing in lightweight description logics
cites work: A logic for default reasoning
cites work: A theory of diagnosis from first principles
cites work: An abductive framework for computing knowledge base updates
cites work: Debugging incoherent terminologies
cites work: On Semantic Update Operators for Answer-Set Programs
cites work: Q5226731
cites work: Measuring Inconsistency in Answer Set Programs
cites work: Q5226733
cites work: The complexity of computing the permanent
DOI: 10.1016/J.ARTINT.2018.11.002
Recommended article: Q3112291
Recommended article: INCOHERENCE AND INCONSISTENCY
Recommended article: Q4440581
Recommended article: Inconsistency without contradiction
Recommended article: Q4781209
Recommended article: Q4329291
Recommended article: Strong Ambiguity
Recommended article: Incompatibility between stability and consistency
Recommended article: Contradictions, from consistency to inconsistency
description: scientific article