A semantic framework for preference handling in answer set programming

Authors:
Torsten Schaub;Kewen Wang
Affiliations:
Institut für Informatik, Universität Potsdam, Postfach 60 15 53, D-14415 Potsdam, Germany (e-mail: torsten@cs.uni-potsdam.de);School of Computing and Information Technology, Griffith University, Brisbane 4111, Australia (e-mail: K.Wang@cit.gu.edu.au)
Venue:
Theory and Practice of Logic Programming
Year:
2003

Citing 21
Cited 8

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
On the relation between default and autoepistemic logic

Artificial Intelligence
Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
The alternating fixpoint of logic programs with negation

PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Defeasible logic

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Foundations of logic programming

Principles of knowledge representation
Answer sets for prioritized logic programs

ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Prioritized conflict handing for logic programs

ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Preferred answer sets for extended logic programs

Artificial Intelligence
The role of default logic in knowledge representation

Logic-based artificial intelligence
Preference logic grammars: fixed point semantics and application to data standardization

Artificial Intelligence
Nonmonotonic Reasoning as Prioritized Argumentation

IEEE Transactions on Knowledge and Data Engineering
Reasoning with Prioritized Defaults

LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
Prioritizing Default Logic

Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
Adding Priorities and Specificity to Default Logic

JELIA '94 Proceedings of the European Workshop on Logics in Artificial Intelligence
A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic

Proceedings of the 10th International Conference on Automated Deduction
A framework for compiling preferences in logic programs

Theory and Practice of Logic Programming
Disjunctive logic programs with inheritance

Theory and Practice of Logic Programming
Well-founded semantics for extended logic programs with dynamic preferences

Journal of Artificial Intelligence Research
On specificity in default logic

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Graphs and colorings for answer set programming with preferences

Fundamenta Informaticae
Default Logics with Preference Order: Principles and Characterisations

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Strong equivalence for logic programs with preferences

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A preference-based framework for updating logic programs

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Using ASP for knowledge management with user authorization

Data & Knowledge Engineering
Preferences in AI: An overview

Artificial Intelligence
nomore: a system for computing preferred answer sets

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Graphs and Colorings for Answer Set Programming with Preferences

Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 inter-relationships and moreover about ways of implementation.