2012/03/02 by Alex Brik, Brik, Alex, Jeffrey B. Remmel +1
Computer Science · #Data Management and Algorithms #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Semantic Web and Ontologies #cs.LO
paper · pdf · doi:10.48550/arxiv.1203.0587
9 pages
arxiv created 2012/03/02 · openalex publication_date 2012/03/02 · arxiv updated 2012/03/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This paper introduces an extension of Answer Set Programming called Preference Set Constraint Programming which is a convenient and general formalism to reason with preferences. PSC programming extends Set Constraint Programming introduced by Marek and Remmel (Marek and Remmel 2004) by introducing two types of preference set constraint atoms, measure preference set constraint atoms and pre-ordered preference set constraint atoms, which are extensions of set constraint atoms. We show that the question of whether a PSC program has a preferred stable model is CoNP-complete. We give examples of the uses of the preference set constraint atoms and show that Answer Set Optimization (Brewka, Niemelä, and Truszczynski 2003) and General Preference (Son and Pontelli 2006) can be expressed using preference set constraint atoms.