2003/01/23 by Torsten Schaub, Schaub, Torsten, Kewen Wang +1
Computer Science · #Artificial Intelligence (cs.AI) #D.1.6 #FOS: Computer and information sciences #I.2.3 #Logic, Reasoning, and Knowledge #Multi-Agent Systems and Negotiation #Semantic Web and Ontologies #cs.AI
paper · pdf · doi:10.48550/arxiv.cs/0301023
39 pages. To appear in Theory and Practice of Logic Programming
arxiv created 2003/01/23 · openalex publication_date 2003/01/23 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We 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.