A semantic framework for preference handling in answer set programming

Simple item page
dc.creatorSchaub, Torsten
dc.creatorWang, Kewen
dc.date2003-01-23
dc.date.accessioned2026-07-07T03:19:22Z
dc.date.available2026-07-07T03:19:22Z
dc.descriptionWe provide a semantic framework for preference handling in answer set programming. To this end, we introduce preference preserving consequence operators. The resulting fixpoint characterizations provide us with a uniform semantic framework for characterizing preference handling in existing approaches. Although our approach is extensible to other semantics by means of an alternating fixpoint theory, we focus here on the elaboration of preferences under answer set semantics. Alternatively, we show how these approaches can be characterized by the concept of order preservation. These uniform semantic characterizations provide us with new insights about interrelationships and moreover about ways of implementation.
dc.description39 pages. To appear in Theory and Practice of Logic Programming
dc.identifierhttps://arxiv.org/abs/cs/0301023
dc.identifierhttp://arxiv.org/abs/cs/0301023
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31436
dc.subjectArtificial Intelligence
dc.subjectI.2.3; D.1.6
dc.titleA semantic framework for preference handling in answer set programming
dc.typetext

Files

Collections

arXiv