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,...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the International Florida Artificial Intelligence Research Society Conference Ročník 37
Hlavní autoři: Marco Wilhelm, Lars-Phillip Spiegel, Gabriele Kern-Isberner
Médium: Journal Article
Jazyk:angličtina
Vydáno: LibraryPress@UF 13.05.2024
Témata:
answer set programming
conditional reasoning
knowledge representation and reasoning
preferential reasoning
preferred answer set programming
tolerance
ISSN:2334-0754, 2334-0762
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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