On Establishing Robust Consistency in Answer Set Programs
Open Access
- 19 September 2022
- journal article
- research article
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 23 (5) , 1094-1127
Abstract
Answer set programs used in real-world applications often require that the program is usable with different input data. This, however, can often lead to contradictory statements and consequently to an inconsistent program. Causes for potential contradictions in a program are conflicting rules. In this paper, we show how to ensure that a program $\mathcal{P}$ remains non-contradictory given any allowed set of such input data. For that, we introduce the notion of conflict-resolving ${\lambda}$ -extensions. A conflict-resolving ${\lambda}$ -extension for a conflicting rule r is a set ${\lambda}$ of (default) literals such that extending the body of r by ${\lambda}$ resolves all conflicts of r at once. We investigate the properties that suitable ${\lambda}$ -extensions should possess and building on that, we develop a strategy to compute all such conflict-resolving ${\lambda}$ -extensions for each conflicting rule in $\mathcal{P}$ . We show that by implementing a conflict resolution process that successively resolves conflicts using ${\lambda}$ -extensions eventually yields a program that remains non-contradictory given any allowed set of input data.
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Characterising and Explaining Inconsistency in Logic Programs2015
- Proof Theories and Algorithms for Abstract Argumentation Frameworks2009
- RBDT-1: A New Rule-Based Decision Tree Generation TechniqueLecture Notes in Computer Science, 2009
- On the existence of stable models of non-stratified logic programsTheory and Practice of Logic Programming, 2006
- On properties of update sequences based on causal rejectionTheory and Practice of Logic Programming, 2002
- Dynamic updates of non-monotonic knowledge basesThe Journal of Logic Programming, 2000
- Classical negation in logic programs and disjunctive databasesNew Generation Computing, 1991
- Three-valued nonmonotonic formalisms and semantics of logic programsArtificial Intelligence, 1991
- A logic for default reasoningArtificial Intelligence, 1980