On establishing robust consistency in answer set programs

Simple item page
dc.contributor.authorThevapalan, Andre
dc.contributor.authorKern-Isberner, Gabriele
dc.date.accessioned2023-04-24T10:57:00Z
dc.date.available2023-04-24T10:57:00Z
dc.date.issued2022-09-19
dc.description.abstractAnswer 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.en
dc.identifier.urihttp://hdl.handle.net/2003/41350
dc.identifier.urihttp://dx.doi.org/10.17877/DE290R-23193
dc.language.isoende
dc.relation.ispartofseriesTheory and practice of logic programming;
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectLogic programmingen
dc.subjectAnswer set programmingen
dc.subjectConsistencyen
dc.subjectContradictionsen
dc.subjectConflictsen
dc.subjectInteractionsen
dc.subject.ddc004
dc.subject.rswkLogische Programmierungde
dc.subject.rswkAnswer Set Programmingde
dc.subject.rswkKonsistenzde
dc.subject.rswkWiderspruchde
dc.subject.rswkKonfliktde
dc.subject.rswkInteraktionde
dc.titleOn establishing robust consistency in answer set programsen
dc.typeTextde
dc.type.publicationtypearticlede
dcterms.accessRightsopen access
eldorado.secondarypublicationtruede
eldorado.secondarypublication.primarycitationTHEVAPALAN, A., & KERN-ISBERNER, G. (2022). On Establishing Robust Consistency in Answer Set Programs. Theory and Practice of Logic Programming, First View, 1-34. doi:10.1017/S1471068422000357de
eldorado.secondarypublication.primaryidentifierhttps://doi.org/10.1017/S1471068422000357de

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
on-establishing-robust-consistency-in-answer-set-programs.pdf
Size:
607.96 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
4.85 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

LS 01 Logik in der Informatik