Authors: | Thevapalan, Andre Kern-Isberner, Gabriele |
Title: | On establishing robust consistency in answer set programs |
Language (ISO): | en |
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 P remains non-contradictory given any allowed set of such input data. For that, we introduce the notion of conflict-resolving λ -extensions. A conflict-resolving λ -extension for a conflicting rule r is a set λ of (default) literals such that extending the body of r by λ resolves all conflicts of r at once. We investigate the properties that suitable λ -extensions should possess and building on that, we develop a strategy to compute all such conflict-resolving λ -extensions for each conflicting rule in P . We show that by implementing a conflict resolution process that successively resolves conflicts using λ -extensions eventually yields a program that remains non-contradictory given any allowed set of input data. |
Subject Headings: | Logic programming Answer set programming Consistency Contradictions Conflicts Interactions |
Subject Headings (RSWK): | Logische Programmierung Answer Set Programming Konsistenz Widerspruch Konflikt Interaktion |
URI: | http://hdl.handle.net/2003/41350 http://dx.doi.org/10.17877/DE290R-23193 |
Issue Date: | 2022-09-19 |
Rights link: | https://creativecommons.org/licenses/by/4.0/ |
Appears in Collections: | LS 01 Logik in der Informatik |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
on-establishing-robust-consistency-in-answer-set-programs.pdf | 607.96 kB | Adobe PDF | View/Open |
This item is protected by original copyright |
This item is licensed under a Creative Commons License