2002/07/15 by Torsten Schaub, Schaub, Torsten, Kewen Wang +1
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #I.2.3 #I.2.4 #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Semantic Web and Ontologies #cs.AI
paper · pdf · doi:10.48550/arxiv.cs/0207060
Proceedings of the Workshop on Preferences in Artificial Intelligence and Constraint In: Proceedings of the Workshop on Non-Monotonic Reasoning (NMR'2002)
arxiv created 2002/07/15 · openalex publication_date 2002/07/15 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We analyze the problem of defining well-founded semantics for ordered logic programs within a general framework based on alternating fixpoint theory. We start by showing that generalizations of existing answer set approaches to preference are too weak in the setting of well-founded semantics. We then specify some informal yet intuitive criteria and propose a semantical framework for preference handling that is more suitable for defining well-founded semantics for ordered logic programs. The suitability of the new approach is convinced by the fact that many attractive properties are satisfied by our semantics. In particular, our semantics is still correct with respect to various existing answer sets semantics while it successfully overcomes the weakness of their generalization to well-founded semantics. Finally, we indicate how an existing preferred well-founded semantics can be captured within our semantical framework.