Preferred answer sets for ordered logic programs

Theory and Practice of Logic Programming

Volumn 6, Issue 1-2, 2006, Pages 107-167

  Van Nieuwenborgh, Davy ^a   Vermeir, Dirk ^a  

^a VRIJE UNIVERSITEIT BRUSSEL   (Belgium)

Author keywords

Answer set programming; Knowledge representation; Nonmonotonic reasoning; Preference

Indexed keywords

COMPUTER SIMULATION; DATABASE SYSTEMS; KNOWLEDGE REPRESENTATION; SEMANTICS;

ANSWER SET PROGRAMMING; NONMONOTONIC REASONING; PREFERENCE;

LOGIC PROGRAMMING;

EID: 31644433974     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068404002315     Document Type: Article

References (43)

1. ALFERES, J. J. AND PEREIRA, L. M. 2000. Updates plus preferences. In: Logic in Artificial Intelligence, Ojeda-Aciego, M., de Guzmán, I. P., Brewka, G. and Pereira, L. M., Eds. LNAZI 1919, Springer-Verlag, pp. 345-360.
2. ARENAS, M., BERTOSSI, L. AND CHOMICKI, J. 1999. Consistent query answers in inconsistent databases. Proceedings of the 18th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. ACM, Philadelphia, pp. 68-79.
3. ARENAS, M., BERTOSSI, L. AND CHOMICKI, J. 2000. Specifying and querying database repairs using logic programs with exceptions. Proceedings of the 4th International Conference on Flexible Query Answering Systems. Springer-Verlag, Warsaw, pp. 27-41.
4. BALDUCCINI, M. 2004. Usa-smart: Improving the quality of plans in answer set planning. Proceedings of the 6th International Symposium on Practical Aspects of Declarative Languages (PADL2004). Lecture Notes in Artificial Intelligence. Springer Verlag.
5. BALDUCCINI, M. AND GELFOND, M. 2003. Logic programs with consistency-restoring rules. In: Proceedings of the International Symposium on Logical Formalization of Commonsense Reasoning, P. Doherty, J. McCarthy and M.-A. Williams, Eds. AAAI 2003 Spring Symposium Series.
6. BALDUCCINI, M. AND MELLARKOD, V. 2003. Cr-prolog2: Cr-prolog with ordered disjunction. ASP03 Answer Set Programming: Advances in Theory and Implementation, volume 78 of CEUR Workshop proceedings.
7. BREWKA, G. 2002. Logic programming with ordered disjunction. Proceedings of the 18th National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence. AAAI Press, pp. 100-105.
8. BREWKA, G., BENFERHAT, S. AND LE BERRE, D. 2002. Qualitative choice logic. In Proceedings of the 8th International Conference on Knowledge Representation and Reasoning. Morgan Kaufmann, pp. 158-169.
9. BREWKA, G. AND EITER, T. 1999. Preferred answer sets for extended logic programs. Artificial Intelligence 109, 1-2 (April), 297-356.
10. BREWKA, G., NIEMELA, I. AND SYRJANEN, T. 2002. Implementing ordered disjunction using answer set solvers for normal programs. In: European Workshop, JELIA 2002, S. Flesca, S. Greco, N. Leone and G. Ianni, Eds. LNAI 2424, Springer-Verlag, pp. 444-455.
11. BRY, F. 1997. Query answering in information systems with integrity constraints. Integrity and Internal Controls in Information Systems I - Increasing the confidence in information systems. Chapman & Hall.
12. BUCCAFURRI, F., FABER, W. AND LEONE, N. 1999. Disjunctive logic programs with inheritance. In: Logic Programming: The 1999 International Conference, D. De Schreye, Ed. MIT Press, pp. 79-93.
13. BUCCAFURRI, F., LEONE, N. AND RULLO, P. 1998. Disjunctive ordered logic: Semantics and expressiveness. In: Proceedings of the 6th International Conference on Principles of Knowledge Representation and Reasoning, A. G. Cohn, L. K. Schubert and S. C. Shapiro, Eds. Morgan Kaufmann, pp. 418-431.
14. CLARK, K. L. 1978. Negation as failure. In: Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plemum Press, New York, pp. 293-322.
15. DE Vos, M. AND VERMEIR, D. 2001. Semantic forcing in disjunctive logic programs. Computational Intelligence 17, 4, 651-684.
16. DELGRANDE, J., SCHAUB, T. AND TOMPITS, H. 2000. Logic programs with compiled preferences. In: Proceedings of the Fourteenth European Conference on Artificial Intelligence (ECAI'2000), W. Horn, Ed. IOS Press, Amsterdam, pp. 392-298.
17. Dix, J., GOTTLOB, G. AND MAREK, V. W. 1996. Reducing disjunctive to non-disjunctive semantics by shift-operations. Fundamenta Informaticae 28, 1-2, 87-100.
18. EITER, T., FINK, M., SABBATINI, G. AND TOMPITS, H. 2000. Considerations on updates of logic programs. In: Logic in Artificial Intelligence, Ojeda-Aciego, M., de Guzmán, I. P., Brewka, G. and Pereira, L. M., Eds. LNAZI 1919, Springer-Verlag, pp. 2-20.
19. EITER, T. AND GOTTLOB, G. 1993. Complexity results for disjunctive logic programming and application to nonmonotonic logics. Proceedings of the 1983 International Logic Programming Symposium. MIT Press, pp. 266-279.
20. EITER, T., GOTTLOB, G. AND LEONE, N. 1997. Abduction from logic programs: Semantics and complexity. Theoretical Computer Science 189, 1-2, 129-177.
21. GABBAY, D., LAENENS, E. AND VERMEIR, D. 1991. Credulous vs. Sceptical Semantics for Ordered Logic Programs. In: Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning, J. Allen, R. Fikes and E. Sandewall, Eds. Morgan Kaufmann, pp. 208-217.
22. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In : Logic Programming, Proceedings of the Fifth International Conference and Symposium, R. A. Kowalski and K. A. Bowen, Eds. MIT Press, pp. 1070-1080.
23. GELFOND, M. AND LIFSCHITZ, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 3-4, 365-386.
24. INOUE, K. AND SAKAMA, C. 1994. On positive occurrences of negation as failure. In: Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, J. Doyle, E. Sandewall and P. Torasso, Eds. Morgan Kaufmann, pp. 293-304.
25. INOUE, K. AND SAKAMA, C. 1996. A fixpoint characterization of abductive logic programs. Journal of Logic Programming 27, 2 (May), 107.136.
26. INOUE, K. AND SAKAMA, C. 1998. Negation as failure in the head. Journal of Logic Programming 35, 1 (April), 39-78.
27. KAKAS, A. C., KOWALSKI, R. A. AND TONI, F. 1992. Abductive logic programming. Journal of Logic and Computation 2, 6, 719-770.
28. KOWALSKI, R. A. AND SADRI, F. 1990. Logic programs with exceptions. In: Proceedings of the 7th International Conference on Logic Programming, D. H. D. Warren and P. Szeredi, Eds. MIT Press, pp. 598-613.
29. LAENENS, E. AND VERMEIR, D. 1990. A logical basis for object oriented programming. In: European Workshop, JELIA 90, J. van Eijck, Ed. LNAI 478, Springer-Verlag, pp. 317-332.
30. LAENENS, E. AND VERMEIR, D. 1992. Assumption-free semantics for ordered logic programs: On the relationship between well-founded and stable partial models. Journal of Logic and Computation 2, 2, 133-172.
31. LEONE, N., RULLO, P. AND SCARCELLO, F. 1997. Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation. Information and Computation 135, 2 (June), 69-112.
32. LIFSCHITZ, V. 2002. Answer set programming and plan generation. Journal of Artificial Intelligence 138, 1-2, 39-54.
33. OJEDA-ACIEGO, M., DE GUZMÁN, I. P., BREWKA, G. AND PEREIRA, L. M., Eds. 2000. Logic in Artificial Intelligence. LNAI 1919, Springer-Verlag.
34. PRZYMUSINSKI, T. C. 1991. Stable semantics for disjunctive programs. New Generation Computing 9, 3-4, 401-424.
35. REITER, R. 1980. A logic for default reasoning. Artificial Intelligence 13, 81-132.
36. SAKAMA, C. AND INOUE, K. 1994. An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal of Automated Reasoning 13, 1, 145-172.
37. SAKAMA, C. AND INOUE, K. 1996. Representing priorities in logic programs. In: Proceedings of the 1996 Joint International Conference and Symposium on Logic Programming, M. J. Maher, Ed. MIT Press, pp. 82-96.
38. SCHAUB, T. AND WANG, K. 2001. A comparative study of logic programs with preference. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI) 2001, B. Nebel, Ed. Morgan Kaufmann, pp. 597-602.
39. VAN EMDEN, M. H. AND KOWALSKI, R. A. 1976. The semantics of predicate logic as a programming language. Journal of the Association for Computing Machinery 23, 4, 733-742.
40. VAN GELDER, A., Ross, K. A. AND SCHLIPF, J. S. 1988. Unfounded sets and well-founded semantics for general logic programs. Proceedings of the 7th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems. ACM Press, pp. 221-230.
41. VAN NIEUWENBORGH, D. AND VERMEIR, D. 2003a. Ordered diagnosis. Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR2003). LNAI 2850, Springer-Verlag, pp. 244-258.
42. VAN NIEUWENBORGH, D. AND VERMEIR, D. 2003b. Ordered programs as abductive systems. Proceedings of the APPIA-GULP-PRODE Conference on Declarative Programming (AGP2003). Regio di Calabria, Italy, pp. 374-385.
43. WANG, K., ZHOU, L. AND LIN, F. 2000. Alternating fixpoint theory for logic programs with priority. In: CL, J. W. Lloyd, V. Dahl, U. Furbach, M. Kerber, K.-K. Lau, C. Palamidessi, L. M. Pereira, Y. Sagiv and P. J. Stuckey, Eds. Lecture Notes in Computer Science 1861. Springer-Verlag. London, UK, pp. 164-178.