Intrinsic Prioritization in Answer Set Programming Based on an Adapted Notion of Tolerance

Answer set programming (ASP) is a declarative programming language suited to solve complex combinatorial search problems. Prioritized ASP is the subdiscipline of ASP which aims at prioritizing the models (answer sets) of ASP programs. Common approaches to prioritized ASP require an additional input,...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the International Florida Artificial Intelligence Research Society Conference Vol. 37
Main Authors: Marco Wilhelm, Lars-Phillip Spiegel, Gabriele Kern-Isberner
Format: Journal Article
Language:English
Published: LibraryPress@UF 13.05.2024
Subjects:
answer set programming
conditional reasoning
knowledge representation and reasoning
preferential reasoning
preferred answer set programming
tolerance
ISSN:2334-0754, 2334-0762
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Answer set programming (ASP) is a declarative programming language suited to solve complex combinatorial search problems. Prioritized ASP is the subdiscipline of ASP which aims at prioritizing the models (answer sets) of ASP programs. Common approaches to prioritized ASP require an additional input, sometimes expressed as special literals within the ASP program, that guides the prioritization of the answer sets. In this paper, to the best of our knowledge, we propose the first approach that is able to prioritize answer sets solely based on the original ASP program. For this, we adapt the notion of tolerance from conditional reasoning according to System Z and establish tolerance partitions of ASP programs which can be used for prioritization.
ISSN:2334-0754
2334-0762
DOI:10.32473/flairs.37.1.135287