ACM Transactions on Database Systems (TODS)
Abduction from logic program: semantics and complexity
Theoretical Computer Science
Answer sets for prioritized logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
Preferred answer sets for extended logic programs
Artificial Intelligence
Prioritized logic programming and its application to commonsense reasoning
Artificial Intelligence
Reasoning with Prioritized Defaults
LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday)
Preferred Answer Sets for Ordered Logic Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Logic programming with ordered disjunction
Eighteenth national conference on Artificial intelligence
A framework for compiling preferences in logic programs
Theory and Practice of Logic Programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Journal of Artificial Intelligence Research
Well-founded semantics for extended logic programs with dynamic preferences
Journal of Artificial Intelligence Research
Complexity of prioritized default logics
Journal of Artificial Intelligence Research
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A comparative study of logic programs with preference
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
nomore: a system for computing preferred answer sets
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
On the semantics of logic programs with preferences
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Hi-index | 0.00 |
This work is a contribution to prioritized reasoning in logic programming in the presence of preference relations involving atoms. The technique, providing a new interpretation for prioritized logic programs, is inspired by the semantics of Prioritized Logic Programming and enriched with the use of structural information of preference of Answer Set Optimization Programming. Specifically, the analysis of the logic program is carried out together with the analysis of preferences in order to determine the choice order and the sets of comparable models. The new semantics is compared with other approaches known in the literature and complexity analysis is also performed, showing that, with respect to other similar approaches previously proposed, the complexity of computing preferred stable models does not increase.