Measuring Inconsistency in Answer Set Programs

  title={Measuring Inconsistency in Answer Set Programs},
  author={Markus Ulbricht and Matthias Thimm and Gerhard Brewka},
We address the issue of quantitatively assessing the severity of inconsistencies in logic programs under the answer set semantics. While measuring inconsistency in classical logics has been investigated for some time now, taking the non-monotonicity of answer set semantics into account brings new challenges that have to be addressed by reasonable accounts of inconsistency measures. We investigate the behavior of inconsistency in logic programs by revisiting existing rationality postulates for… 
Inconsistency Measures for Disjunctive Logic Programs Under Answer Set Semantics
This work investigates the behaviour of inconsistency in logic programs by revisiting existing rationality postulates for inconsistency measurement and developing novel ones taking non-monotonicity into account, and develops new measures for this setting.
Measuring Strong Inconsistency
This work proposes measures based on the structure of minimal strongly K-inconsistent subsets of a knowledge base K—a generalization of minimal inconsistency to arbitrary, possibly nonmonotonic, frameworks.
Strong inconsistency
On Minimal Corrections in ASP
It is shown that a variety of algorithms for correction set computation in propositional logic can be ported to ASP and an experimental evaluation was carried showing that having a portfolio of such algorithms is indeed of benefit.
Classifying Inconsistency Measures Using Graphs
A general framework for comparing syntactic measures of inconsistency is introduced based on the notion of an inconsistency graph for each knowledgebase and it is shown that various measures can be computed using the inconsistency graph.
Towards a Unified Framework for Syntactic Inconsistency Measures
This paper introduces a general framework for comparing syntactic inconsistency measures that uses the construction of an inconsistency graph for each knowledgebase and introduces abstractions of the inconsistency graph and uses the hierarchy of the abstractions to classify a range of inconsistency measures.
Basic Postulates for Inconsistency Measures
  • P. Besnard
  • Psychology
    Trans. Large Scale Data Knowl. Centered Syst.
  • 2017
A set of basic postulates alternative to the core set given by Hunter and Konieczny arises, which suggest a systematic transformation to guard postulates against a certain kind of counter-examples.
Answering the “why” in answer set programming – A survey of explanation approaches
An overview of approaches that provide an answer to the question of why an answer set is a solution to a given problem, notably off-line justifications, causal graphs, argumentative explanations, and why-not provenance are given, and highlight their similarities and differences.


On the expressivity of inconsistency measures
Characterising and Explaining Inconsistency in Logic Programs
Overall, four different inconsistency cases are identified, and it is shown how the respective reason can be further characterised by a set of culprits using semantics which are weaker than the answer set semantics.
Measuring Inconsistency through Minimal Inconsistent Sets
This paper defines a very natural inconsistency value from these minimal inconsistent sets, and provides a complete axiomatization of this value in terms of five simple and intuitive axioms.
Linear Programs for Measuring Inconsistency in Probabilistic Logics
A new family of inconsistency measures for probabilistic knowledge bases is studied, all of which satisfy many desirable properties and can be computed by means of convex optimization techniques.
Measuring Inconsistency in Fuzzy Answer Set Semantics
This paper deals with the definition of measures of inconsistency in the residuated-logic-programming paradigm under the fuzzy answer set semantics, which provides a soft mechanism to control the amount of information inferred and, thus, controlling the inconsistencies by modifying slightly the truth values of some rules.
Inconsistency measures for probabilistic logics
Measuring instability in normal residuated logic programs: Adding information
This work focuses on the measure of instability of normal residuated programs and focuses precisely on the case in which stability can be recovered by adding information to the authors' program.
Measuring inconsistency in knowledgebases
This work provides a measure to quantify the inconsistency of a knowledgebase, thereby allowing for the comparison of the consistency of various knowledgebases, represented as first-order logic formulas, using quasi-classical (QC) logic.
Hypothetical Updates, Priority and Inconsistency in a Logic Programming Language
A logic programming language which supports hypothetical updates together with integrity constraints and makes use of a revision mechanism to restore consistency when an update violates some integrity constraint is proposed.
A Possibilistic Analysis of Inconsistency
This paper explores the interest of considering the minimal inconsistent subsets in this setting, and proposes extensions based on the notions of paraconsistent completion of a possibilistic logic base and of safely supported formulas for handling formulas below the level of inconsistency.