• search hit 18 of 30
Back to Result List

Graphs and colorings for answer set programming with preferences

  • The integration of preferences into answer set programming constitutes an important practical device for distinguishing certain preferred answer sets from non-preferred ones. To this end, we elaborate upon rule dependency graphs and their colorings for characterizing different preference handling strategies found in the literature. We start from a characterization of (three types of) preferred answer sets in terms of totally colored dependency graphs. In particular, we demonstrate that this approach allows us to capture all three approaches to preferences in a uniform setting by means of the concept of a height function. In turn, we exemplarily develop an operational characterization of preferred answer sets in terms of operators on partial colorings for one particular strategy. In analogy to the notion of a derivation in proof theory, our operational characterization is expressed as a (non-deterministically formed) sequence of colorings, gradually turning an uncolored graph into a totally colored one

Export metadata

Additional Services

Search Google Scholar Statistics
Metadaten
Author details:Kathrin Konczak, Torsten H. SchaubORCiDGND, Thomas Linke
ISSN:0169-2968
Publication type:Article
Language:English
Year of first publication:2003
Publication year:2003
Release date:2017/03/24
Source:Fundamenta informaticae / Polish Mathematical Society. - ISSN 0169-2968. - 57 (2003), 2 - 4, S. 393 - 421
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik und Computational Science
Institution name at the time of the publication:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik
Accept ✔
This website uses technically necessary session cookies. By continuing to use the website, you agree to this. You can find our privacy policy here.