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
Answer sets for prioritized logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Three-valued formalization of logic programming: is it needed?
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Preferred answer sets for extended logic programs
Artificial Intelligence
Basic Forward Chaining Construction for Logic Programs
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
Reasoning with Prioritized Defaults
LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
Defeasible specifications in action theories
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Well-founded semantics for extended logic programs with dynamic preferences
Journal of Artificial Intelligence Research
Compiling reasoning with and about preferences into default logic
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Embracing causality in specifying the indirect effects of actions
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Logic Programming with Defaults and Argumentation Theories
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Defeasibility in answer set programs via argumentation theories
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Aggregates and priorities in P2P data management systems
Proceedings of the 15th Symposium on International Database Engineering & Applications
On the semantics of logic programs with preferences
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Aggregates and preferences in logic programming
ISMIS'05 Proceedings of the 15th international conference on Foundations of Intelligent Systems
Graphs and Colorings for Answer Set Programming with Preferences
Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)
A selective semantics for logic programs with preferences
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
| Hi-index | 0.00 |
van Gelder's alternating fixpoint theory has proven to be a very useful tool for unifying and characterizing various semantics for logic programs without priority. In this paper we propose an extension of van Gelder's alternating fixpoint theory and show that it can be used as a general semantic framework for logic programs with priority. Specifically, we define three declarative and model-theoretic semantics in this framework for prioritied logic programs: prioritized answer sets, prioritized regular extensions and prioritized well-founded model. We show that all of these semantics are natural generalizations of the corresponding semantics for logic programs without priority. We also show that these semantics have some other desirable properties. In particular, they can handle conflicts caused indirectly by the priorities.