A framework for compiling preferences in logic programs

Theory and Practice of Logic Programming

Volumn 3, Issue 2, 2003, Pages 129-187

  Delgrande, James P ^a   Schaub, Torsten ^a,b   Tompits, Hans ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF POTSDAM   (Germany)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Answer sets semantics; Compilation; Preference

Indexed keywords

MATHEMATICAL TRANSFORMATIONS; PROGRAM COMPILERS; SEMANTICS; SET THEORY; THEOREM PROVING;

META-FORMALISMS;

LOGIC PROGRAMMING;

EID: 0345538690     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068402001539     Document Type: Article

References (47)

1. Baader, F. and Hollunder, B. (1993) How to prefer more specific defaults in terminological default logic. In: Bajcsy, R. (ed.), Proceedings 13th International Joint Conference on Artificial Intelligence (IJCAI'93), pp. 669-674. Morgan Kaufmann.
2. Benferhat, S., Cayrol, C., Dubois, D., Lang, J. and Prade, H. (1993) Inconsistency management and prioritized syntax-based entailment. In: Bajcsy, R. (ed.), Proceedings 13th International Joint Conference on Artificial Intelligence (IJCAI'93), pp. 640-647. Morgan Kaufmann.
3. Besnard, Ph., Mercer, R. and Schaub, T. (2002) Optimality theory via default logic. In: Benferhat, S. and Giunchiglia, E. (eds.), Proceedings 9th International Workshop on Non-Monotonic Reasoning, pp. 77-83.
4. Brewka, G. (1989) Preferred subtheories: An extended logical framework for default reasoning. Proceedings 11th International Joint Conference on Artificial Intelligence (IJCAI'89), pp. 1043-1048. Morgan Kaufmann.
5. Brewka, G. (1994) Adding priorities and specificity to default logic. In: Pereira, L. and Pearce, D. (eds.), European Workshop on Logics in Artificial Intelligence (JELIA'94): Lecture Notes in Artificial Intelligence 838, pp. 247-260. Springer-Verlag.
6. Brewka, G. (1996) Well-founded semantics for extended logic programs with dynamic preferences. J. Artif. Intell. Res. 4, 19-36.
7. Brewka, G. and Eiter, T. (1998) Preferred answer sets for extended logic programs. In: Cohn, A., Schubert, L. and Shapiro, S. (eds.), Proceedings 6th International Conference on the Principles of Knowledge Representation and Reasoning (KR'98), pp. 86-97. Morgan Kaufmann.
8. Brewka, G. and Eiter, T. (1999) Preferred answer sets for extended logic programs. Artif. Intell. 109(1-2), 297-356.
9. Brewka, G. and Eiter, T. (2000) Prioritizing default logic. In: Hölldobler, St. (ed.), Intellectics and Computational Logic - Papers in Honour of Wolfgang Bibel, pp. 27- 45. Kluwer Academic.
10. Delgrande, J. and Schaub, T. (1997) Compiling reasoning with and about preferences into default logic. In: Pollack, M. (ed.), Proceedings 15th International Joint Conference on Artificial Intelligence (IJCAI'97), pp. 168-174. Morgan Kaufmann.
11. Delgrande, J. and Schaub, T. (2000a) Expressing preferences in default logic. Artif. Intell. 123(1-2), 41-87.
12. Delgrande, J. and Schaub, T. (2000b) The role of default logic in knowledge representation. In: Minker, J. (ed.), Logic-Based Artificial Intelligence, pp. 107-126. Kluwer Academic.
13. Delgrande, J., Schaub, T. and Tompits, H. (2000a) A compilation of Brewka and Eiter's approach to prioritization. In: Ojeda-Aciego, M., Guzmán, I., Brewka, G. and Pereira, L. (eds.), Proceedings 8th European Workshop on Logics in Artificial Intelligence (JELIA 2000): Lecture Notes in Artificial Intelligence 1919, pp. 376-390. Springer- Verlag.
14. Delgrande, J., Schaub, T. and Tompits, H. (2000b) A compiler for ordered logic programs. In: Baral, C. and Truszczyński, M. (eds.), Proceedings 8th International Workshop on Non-Monotonic Reasoning. arXiv.org e-Print archive. System Abstract.
15. Delgrande, J., Schaub, T. and Tompits, H. (2000c) Logic programs with compiled preferences. In: Baral, C. and Truszczyński, M. (eds.), Proceedings 8th International Workshop on Non-Monotonic Reasoning. arXiv.org e-Print archive.
16. Delgrande, J., Schaub, T. and Tompits, H. (2000d) Logic programs with compiled preferences. In: Horn, W. (ed.), Proceedings 14th European Conference on Artificial Intelligence (ECAI 2000), pp. 392-398. IOS Press.
17. Delgrande, J., Schaub, T. and Tompits, H. (2001) plp: A generic compiler for ordered logic programs. In: Eiter, T., Faber, W. and Truszczyński, M. (eds.), Proceedings 6th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2001): Lecture Notes in Artificial Intelligence 2173, pp. 411-415. Springer-Verlag.
18. Doyle, J. and Wellman, M. (1991) Impediments to universal preference-based default theories. Artif. Intell. 49(1-3), 97-128.
19. Eiter, T. and Gottlob, G. (1995) The complexity of logic-based abduction. J. ACM, 42, 3-42.
20. Eiter, T., Leone, N., Mateis, C., Pfeifer, G. and Scarcello, F. (1997) A deductive system for nonmonotonic reasoning. In: Dix, J., Furbach, U. and Nerode, A. (eds.), Proceedings 4th International Conference on Logic Programming and Non-Monotonic Reasoning (LPNMR'97): Lecture Notes in Artificial Intelligence 1265, pp. 363-374. Springer-Verlag.
21. Eiter, T., Fink, M., Sabbatini, G. and Tompits, H. (2002) A generic approach for knowledge-based information-site selection. Proceedings 8th International Conference on the Principles of Knowledge Representation and Reasoning (KR 2002 ), pp. 459-469. Morgan Kaufmann.
22. Geffner, H. and Pearl, J. (1992) Conditional entailment: Bridging two approaches to default reasoning. Artif. Intell. 53(2-3), 209-244.
23. Gelfond, M. and Lifschitz, V. (1988) The stable model semantics for logic programming. Proceedings 5th International Conference on Logic Programming (ICLP'88), pp. 1070-1080. The MIT Press.
24. Gelfond, M. and Lifschitz, V. (1991) Classical negation in logic programs and deductive databases. New Generat. Comput. 9, 365-385.
25. Gelfond, M. and Son, T. (1997) Reasoning with prioritized defaults. In: Dix, J., Pereira, L. and Przymusinski, T. (eds.), Third International Workshop on Logic Programming and Knowledge Representation: Lecture Notes in Computer Science 1471, pp. 164-223. Springer-Verlag.
26. Gelfond, M., Przymusinska, H. and Przymusinski, T. (1989) On the relationship between circumscription and negation as failure. Artif. Intell., 38(1), 75-94.
27. Gordon, T. (1993) The pleading game: An artificial intelligence model of procedural justice. Dissertation, Technische Hochschule Darmstadt, Germany.
28. Kager, R. (1999) Optimality Theory: A textbook. Cambridge University Press.
29. Konolige, K. (1988) Hierarchic autoepistemic theories for nonmonotonic reasoning. Proceedings 7th National Conference on Artificial Intelligence (AAAI'88), pp. 439-443. Morgan Kaufmann.
30. Lifschitz, V. (1996) Foundations of logic programming. In: Brewka, G. (ed.), Principles of Knowledge Representation, pp. 69-127. CSLI Publications.
31. McCarthy, J. (1986) Applications of circumscription to formalizing common-sense knowledge. Artif. Intell. 28, 89-116.
32. Nebel, B. (1998) How hard is it to revise a belief base? In: Dubois, D. and Prade, H. (eds.), Handbook of Defeasible Reasoning and Uncertainty Management Systems, Volume 3: Belief Change. Kluwer Academic.
33. Niemelä, I. and Simons, P. (1997) Smodels: An implementation of the stable model and well-founded semantics for normal logic programs. In: Dix, J., Furbach, U. and Nerode, A. (eds.), Proceedings of the Fourth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'97): Lecture Notes in Artificial Intelligence 1265, pp. 420-429. Springer-Verlag.
34. Papadimitriou, C. and Sideri, M. (1994) Default theories that always have extensions. Artif. Intell. 69, 347-357.
35. Prince, A. and Smolensky, P. (1993) Optimally theory: Constraint interaction in generative grammar. Technical report, University of Colorado.
36. Reiter, R. (1980) A logic for default reasoning. Artif. Intell. 13(1-2), 81-132.
37. Rintanen, J. (1994) Prioritized autoepistemic logic. In: MacNish, C., Pearce, D. and Pereira, L. M. (eds.), Proceedings of the European Workshop on Logics in Artificial Intelligence (JELIA'94): Lecture Notes in Artificial Intelligence 838, pp. 232-246. Springer-Verlag.
38. Rintanen, J. (1998a) Complexity of prioritized default logics. J. Artif. Intell. Res. 9, 423-461.
39. Rintanen, J. (1998b) Lexicographic priorities in default logic. Artif. Intell. 106, 221-265.
40. Sakama, C. and Inoue, K. (1996) Representing priorities in logic programs. In: Maher, M. (ed.), Proceedings Joint International Conference and Symposium on Logic Programming, pp. 82-96. Cambridge: The MIT Press.
41. Sakama, C. and Inoue, K. (2000) Prioritized logic programming and its application to commonsense reasoning. Artif. Intell. 123(1-2), 185-222.
42. Schaub, T. and Wang, K. (2001a) A comparative study of logic programs with preference. In: Nebel, B. (ed.), Proceedings 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 597-602. Morgan Kaufmann.
43. Schaub, T. and Wang, K. (2001b) Towards a semantic framework for preference handling in logic programming (submitted).
44. van der Hoek, W. and Witteveen, C. (2000) Classical and general frameworks for recovery. In: Horn, W. (ed.), Proceedings 14th European Conference on Artificial Intelligence (ECAI 2000), pp. 33-37. IOS Press.
45. Wang, K., Zhou, L. and Lin, F. (2000) Alternating fixpoint theory for logic programs with priority. Proceedings 1st International Conference on Computational Logic (CL 2000): Lecture Notes in Computer Science 1861, pp. 164-178. Springer-Verlag.
46. Zhang, Y. (2000) Logic program based updates. Draft available at http://www.cit.uws.edu.au/yan/.
47. Zhang, Y. and Foo, N. (1997) Answer sets for prioritized logic programs. In: Maluszynski, J. (ed.), Proceedings International Symposium on Logic Programming (ILPS'97), pp. 69-84. The MIT Press.