Integrated Use of System Z for Preferred Answer Set Programming

Answer set programming (ASP) and conditional reasoning are powerful KR formalisms capable of expressing default statements that usually hold but also allow for exceptions. While ASP excels with an intuitive rule-based syntax, fast solvers, and is suited to solve complex combinatorial search problems...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of the International Florida Artificial Intelligence Research Society Conference Ročník 38; číslo 1
Hlavní autoři: Wilhelm, Marco, Thevapalan, Andre, Kern-Isberner, Gabriele
Médium: Journal Article
Jazyk:angličtina
Vydáno: LibraryPress@UF 14.05.2025
Témata:
conditional reasoning
preferred answer set programming
System Z
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) and conditional reasoning are powerful KR formalisms capable of expressing default statements that usually hold but also allow for exceptions. While ASP excels with an intuitive rule-based syntax, fast solvers, and is suited to solve complex combinatorial search problems, conditionals provide a sophisticated preference-based semantics and yield principled inferences. In this paper, we investigate and compare different computational approaches on utilizing conditional background knowledge in order to prioritize the solutions of ASP programs. For this, we compile the specification of the System Z ranking model of conditionals into ASP constraints and, therewith, integrate the guidelines for prioritization according to System Z directly into the ASP programs.
ISSN:2334-0754
2334-0762
DOI:10.32473/flairs.38.1.138664