A semantic framework for preference handling in answer set programming

Theory and Practice of Logic Programming

Volumn 3, Issue 4-5, 2003, Pages 569-607

  Schaub, Torsten ^a,c   Wang, Kewen ^b  

^a UNIVERSITY OF POTSDAM   (Germany)

^b GRIFFITH UNIVERSITY   (Australia)

^c SIMON FRASER UNIVERSITY   (Canada)

Author keywords

Answer set programming; Preferences; Priorities

Indexed keywords

POLYNOMIALS; PROBLEM SOLVING; SEMANTICS; SET THEORY; THEOREM PROVING;

ANSWER SET PROGRAMMING; LEGAL REASONING SYSTEMS;

LOGIC PROGRAMMING;

EID: 0345393809     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068403001844     Document Type: Article

References (36)

1. ALFERES, J., LEITE, J., PEREIRA, L., PRZYMUSINSKA, H. AND PRZYMUSINSKI, T. 1998. Dynamic logic programming. In: A. Cohn et al. (Eds.), Proceedings International Conference on the Principles of Knowledge Representation and Reasoning, pp. 98-109. Morgan Kaufmann.
2. APT, K., BLAIR, H. AND WALKER, A. 1987. Towards a theory of declarative knowledge. In: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, Chapter 2, pp. 89-148. Morgan Kaufmann.
3. BAADER, F. AND HOLLUNDER, B. 1993. How to prefer more specific defaults in terminological default logic. In: R. Bajcsy (Ed.), Proceedings International Joint Conference on Artificial Intelligence, pp. 669-674. Morgan Kaufmann.
4. BREWKA, G. 1994. Adding priorities and specificity to default logic. In: L. Pereira and D. Pearce (Eds.), European Workshop on Logics in Artificial Intelligence, pp. 247-260. Springer.
5. BREWKA, G. 1996. Well-founded semantics for extended logic programs with dynamic preferences. Journal of Artificial Intelligence Research 4, 19-36.
6. BREWKA, G. 2001. On the relation between defeasible logic and well-founded semantics. In: T. Eiter, W. Faber and M. Truszczyński (Eds.), Proceedings International Conference on Logic Programming and Nonmonotonic Reasoning, pp. 121-132. Springer.
7. BREWKA, G. AND EITER, T. 1999. Preferred answer sets for extended logic programs. Artificial Intelligence 109, 1-2, 297-356.
8. BREWKA, G. AND EITER, T. 2000. Prioritizing default logic. In: S. Hölldobler (Ed.), Intellectics and Computational Logic: Papers in Honour of Wolfgang Bibel, pp. 27-45. Kluwer Academic.
9. BUCCAFURRI, F., FABER, W. AND LEONE, N. 1999. Disjunctive logic programs with inheritance. Theory and Practice of Logic Programming 2, 3, 293-321.
10. CUI, B. AND SWIFT, T. 2002. Preference logic grammars: Fixed-point semantics and application to data standardization. Artificial Intelligence 138, 1-2, 117-147.
11. DELGRANDE, J. AND SCHAUB, T. 2000. The role of default logic in knowledge representation. In: J. Minker (Ed.), Logic-Based Artificial Intelligence, pp. 107-126. Kluwer Academic.
12. DELGRANDE, J., SCHAUB, T. AND TOMPITS, H. 2000a. A compilation of Brewka and Eiter's approach to prioritization. In: M. Ojeda-Aciego, I. Guzmán, G. Brewka and L. Pereira (Eds.), Proceedings European Workshop on Logics in Artificial Intelligence, pp. 376-390. Springer.
13. DELGRANDE, J., SCHAUB, T. AND TOMPITS, H. 2000b. Logic programs with compiled preferences. In: W. Horn (Ed.), Proceedings European Conference on Artificial Intelligence, pp. 392-398. IOS Press.
14. DELGRANDE, J., SCHAUB, T. AND TOMPITS, H. 2003. A framework for compiling preferences in logic programs. Theory and Practice of Logic Programming 3, 2.
15. DIMOPOULOS, Y. AND KAKAS, C. 1995. Logic programming without negation as failure. In: J. Lloyd (Ed.), Proceedings International Symposium of Logic Programming, pp. 369-383. MIT Press.
16. EITER, T., FINK, M., SABBATINI, G. AND TOMPITS, H. 2000. Considerations on updates of logic programs. Proceedings Seventh European Workshop on Logics in Artificial Intelligence, pp. 2-20. Springer.
17. GELFOND, M. AND SON, T. 1997. Reasoning with prioritized defaults. In: J. Dix, L. Pereira and T. Przymusinski (Eds.), International Workshop on Logic Programming and Knowledge Representation, pp. 164-223 Springer.
18. GORDON, T. 1993. Dissertation. TU Darmstadt, Germany.
19. GROSOF, B. 1997. Prioritized conflict handling for logic programs. In: J. Maluszynsk (Ed.), Logic Programming: Proceedings International Symposium, pp. 197-211. MIT Press.
20. GROSOF, B. 1999. Business rules for electronic commerce. IBM Research. http://www.research.ibm.com/rules/.
21. KONOLIGE, K. 1988. On the relation between default and autoepistemic logic. Artificial Intelligence 35, 2, 343-382.
22. LIFSCHITZ, V. 1996. Foundations of logic programming. In: G. Brewka (Ed.), Principles of Knowledge Representation, pp. 69-127. CSLI Publications.
23. LLOYD, J. 1987. Foundations of Logic Programming, 2nd ed. Springer-Verlag.
24. NUTE, D. 1987. Defeasible reasoning. Proceedings Hawaii International Conference on Systems Science, pp. 470-477. IEEE Press.
25. NUTE, D. 1994. Defeasible logic. Handbook of Logics in Artificial Intelligence and Logic Programming, Vol. 3, pp. 353-395. Oxford University Press.
26. PRADHAN, S. AND MINKER, J. 1996. Using priorities to combine knowledge bases. International Journal of Cooperative Information Systems 5, 2-3, 333-364.
27. PRAKKEN, H. 1997. Logical Tools for Modelling Legal Argument. Kluwer Academic.
28. PRZYMUSINSKI, T. 1988. On the declarative semantics of deductive databases and logic programs. In: J. Minker (Ed.), Foundations of Deductive Databases and Logic Programming, pp. 193-216. Morgan Kaufmann.
29. RINTANEN, J. 1995. On specificity in default logic. Proceedings International Joint Conference on Artificial Intelligence, pp. 1474-1479. Morgan Kaufmann.
30. SAKAMA, C. AND INOUE, K. 1996. Representing priorities in logic programs. In: M. Maher (Ed.), Proceedings Joint International Conference and Symposium on Logic Programming, pp. 82-96. MIT Press.
31. SCHAUB, T. AND WANG, K. 2002. Preferred well-founded semantics for logic programming by alternating fixpoints: Preliminary report. Proceedings Workshop on Nonmonotonic Reasoning, pp. 238-246.
32. SCHWIND, C. 1990. A tableaux-based theorem prover for a decidable subset of default logic. In: M. Stickel (Ed.), Proceedings Conference on Automated Deduction, pp. 528-542. Springer.
33. VAN GELDER, A. 1993. The alternating fixpoint of logic programs with negation. Journal of Computer and System Science 47, 185-120.
34. WANG, K., ZHOU, L. AND LIN, F. 2000. Alternating fixpoint theory for logic programs with priority. Proceedings International Conference on Computational Logic, pp. 164-178. Springer.
35. YOU, J., WANG, X. AND YUAN, L. 2001. Nonmonotonic reasoning as prioritized argumentation. IEEE Transactions on Knowledge and Data Engineering 6, 13, 968-979.
36. ZHANG, Y. AND FOO, N. 1997. Answer sets for prioritized logic programs. In: J. Maluszynski (Ed.), Proceedings International Symposium on Logic Programming, pp. 69-84. MIT Press.