Prioritized logic programming and its application to commonsense reasoning

Artificial Intelligence

Volumn 123, Issue 1-2, 2000, Pages 185-222

  Sakama, Chiaki ^a   Inoue, Katsumi ^b  

^a WAKAYAMA UNIVERSITY   (Japan)

^b KOBE UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING;

PRIORITIZED LOGIC PROGRAMMING (PLP);

ARTIFICIAL INTELLIGENCE;

EID: 0034301195     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(00)00054-0     Document Type: Article

References (58)

1. Analyti A., Pramanik S. Reliable semantics for extended logic programs with rule prioritization. J. Logic Comput. 5:(3):1995;303-324.
2. Apt K.R., Blair H.A., Walker A. Towards a theory of declarative knowledge. Minker J. Foundations of Deductive Databases and Logic Programming. 1988;89-148 Morgan Kaufmann, Los Altos, CA.
3. Baader F., Hollunder B. Priorities on defaults with prerequisites, and their application in treating specificity in terminological default logic. J. Automat. Reason. 15:1995;41-68.
4. Baral C., Gelfond M. Logic programming and knowledge representation. J. Logic Programming. 19-20:1994;73-148.
5. Bossu G., Siegel P. Saturation, nonmonotonic reasoning and the closed world assumption. Artificial Intelligence. 25:1995;13-63.
6. Brewka G. Reasoning about priorities in default logic. AAAI-94, Seattle, WA. 1994;940-945 MIT Press, Cambridge, MA.
7. Brewka G. Well-founded semantics for extended logic programs with dynamic preferences. J. Artificial Intelligence Res. 4:1996;19-36.
8. Brewka G., Eiter T. Preferred answer sets for extended logic programs. Artificial Intelligence. 109:1999;297-356.
9. Buccafurri F., Leone N., Rullo P. Semantics and expressiveness of disjunctive ordered logic. Ann. Math. Artificial Intelligence. 25:1999;311-337.
10. Buccafurri F., Faber W., Leone N. Disjunctive logic programs with inheritance. Proc. 1999 International Conference on Logic Programming. 1999;79-93 MIT Press, Cambridge, MA.
11. Chen J. Embedding prioritized circumscription in logic programs. Proc. 10th International Symposium on Foundations of Intelligent Systems (ISMIS-97). Lecture Notes in Artificial Intelligence. 1325:1997;50-59 Springer, Berlin.
12. Delgrande J., Schaub T. Compiling reasoning with and about preference into default logic. Proc. IJCAI-97, Nagoya, Japan. 1997;168-174 Morgan Kaufmann, Los Altos, CA.
13. Dimopoulos Y., Kakas A.C. Logic programming without negation as failure. Proc. 1995 International Logic Programming Symposium. 1995;369-383 MIT Press, Cambridge, MA.
14. Eiter T., Gottlob G. The complexity of logic-based abduction. J. ACM. 42:1995;3-42.
15. Eiter T., Gottlob G., Leone N. Abduction from logic programs: Semantics and complexity. Theoret. Comput. Sci. 189:(1-2):1997;129-177.
16. Eiter T., Faber W., Leone N., Pfeifer G. The diagnosis front-end of the dlv system. AI Comm. 12:1999;99-111.
17. Etherington D.W. Formalizing nonmonotonic reasoning systems. Artificial Intelligence. 31:1987;41-85.
18. Gelfond M., Lifschitz V. Compiling circumscriptive theories into logic programs. Proc. AAAI-88, St. Paul, MN. 1988;455-459 MIT Press, Cambridge, MA.
19. Gelfond M. Epistemic approach to formalization of commonsense reasoning. 1991;Technical Report TR-91-2, University of Texas at El Paso, TX.
20. Gelfond M., Lifschitz V. Classical negation in logic programs and disjunctive databases. New Generation Comput. 9:(3,4):1991;365-385.
21. Gelfond M., Son T.C. Reasoning with prioritized defaults. Proc. 3rd International Workshop on Logic Programming and Knowledge Representation. Lecture Notes in Artificial Intelligence. 1471:1998;164-223 Springer, Berlin.
22. Gottlob G. Complexity results for nonmonotonic logics. J. Logic Comput. 2:(3):1992;397-425.
23. Grosof B.N. Generalizing prioritization. Proc. 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR-91), Cambridge, MA. 1991;289-300 Morgan Kaufmann, Los Altos, CA.
24. Grosof B.N. Prioritized conflict handling for logic programs. Proc. 1997 International Logic Programming Symposium. 1997;197-211 MIT Press, Cambridge, MA.
25. Govindarajan K., Jayaraman B., Mantha S. Preference logic programming. Proc. 12th International Conference on Logic Programming. 1995;731-745 MIT Press, Cambridge, MA.
26. Inoue K., Sakama C. Negation as failure in the head. J. Logic Program. 35:(1):1998;39-78. A shorter version: On positive occurrences of negation as failure, in: Proc. 4th International Conference on Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany, Morgan Kaufmann, Los Altos, CA, 1994, pp. 293-304.
27. Inoue K. Linear resolution for consequence finding. Artificial Intelligence. 56:1992;301-353.
28. Inoue K. Hypothetical reasoning in logic programs. J. Logic Programming. 18:(3):1994;191-227.
29. Inoue K., Sakama C. A fixpoint characterization of abductive logic programs. J. Logic Programming. 27:(2):1996;107-136. A shorter version: Transforming abductive logic programs to disjunctive programs, in: Proc. 10th International Conference on Logic Programming, MIT Press, Cambridge, MA, 1993, pp. 335-353.
30. Inoue K., Sakama C. Abducing priorities to derive intended conclusions. Proc. IJCAI-99, Stockholm, Sweden. 1999;44-49 Morgan Kaufmann, Los Altos, CA.
31. Janhunen T. On the intertranslatability of autoepistemic, default and priority logics, and parallel circumscription. Proc. European Workshop on Logics in Artificial Intelligence (JELIA-98). Lecture Notes in Artificial Intelligence. 1489:1998;216-232 Springer, Berlin.
32. Kakas A.C., Kowalski R.A., Toni F. Abductive logic programming. J. Logic Comput. 2:1992;719-770.
33. Kowalski R.A. Algorithm = Logic + Control. Comm. ACM. 22:1979;424-435.
34. Kowalski R.A., Sadri F. Logic programs with exception. New Generation Comput. 9:(3, 4):1991;387-400.
35. Lifschitz V. Computing circumscription. Proc. IJCAI-85, Los Angeles, CA. 1985;121-127 Morgan Kaufmann, Los Altos, CA.
36. Lifschitz V. On the satisfiability of circumscription. Artificial Intelligence. 28:1986;17-27.
37. Lifschitz V., Woo T.Y.C. Answer sets in general nonmonotonic reasoning (preliminary report). Proc. 3rd International Conference on Principles of Knowledge Representation and Reasoning (KR-92), Cambridge, MA. 1992;603-614 Morgan Kaufmann, Los Altos, CA.
38. Lifschitz V. Minimal belief and negation as failure. Artificial Intelligence. 70:1994;53-72.
39. Lifschitz V. Circumscription. Gabbay D.M., et al. Handbook of Logic in Artificial Intelligence and Logic Programming. 3:1994;297-352 Clarendon Press, Oxford.
40. Lloyd J.W. Foundations of Logic Programming. 2nd edn. 1987;Springer, Berlin.
41. Lobo J., Minker J., Rajasekar A. Foundations of Disjunctive Logic Programming. 1992;MIT Press, Cambridge, MA.
42. McCarthy J. Circumscription - A form of nonmonotonic reasoning. Artificial Intelligence. 13:1980;27-39.
43. Pereira L.M., Alferes J.J., Aparicio N. Contradiction removal within well-founded semantics. Proc. 1st International Workshop on Logic Programming and Nonmonotonic Reasoning. 1991;105-119 MIT Press, Cambridge, MA.
44. Poole D. A logical framework for default reasoning. Artificial Intelligence. 36:(1):1988;27-47.
45. Pradhan S., Minker J. Using priorities to combine knowledge bases. J. Intelligent and Cooperative Information Systems. 5:(2, 3):1996;333-364.
46. Przymusinski T.C. On the declarative semantics of deductive databases and logic programs. Minker J. Foundations of Deductive Databases and Logic Programming. 1988;193-216 Morgan Kaufmann, Los Altos, CA.
47. Przymusinski T.C. Stable semantics for disjunctive programs. New Generation Comput. 9:(3, 4):1991;401-424.
48. Reiter R. A logic for default reasoning. Artificial Intelligence. 13:1980;81-132.
49. Reiter R., Criscuolo G. On interacting defaults. Proc. IJCAI-81, Vancouver, BC. 1981;270-276 Morgan Kaufmann, Los Altos, CA.
50. Rintanen J. Lexicographic priorities in default logic. Artificial Intelligence. 106:1998;221-265.
51. Shoham Y. Nonmonotonic logics: Meaning and utility. Proc. IJCAI-87, Milan, Italy. 1987;388-393 Morgan Kaufmann, Los Altos, CA.
52. Sakama C., Inoue K. Embedding circumscriptive theories in general disjunctive programs. Proc. 3rd International Conference on Logic Programming and Nonmonotonic Reasoning. Lecture Notes in Artificial Intelligence. 928:1995;344-357 Springer, Berlin.
53. Sakama C., Inoue K. Representing priorities in logic programs. Proc. 1996 Joint International Conference and Symposium on Logic Programming. 1996;82-96 MIT Press, Cambridge, MA.
54. Stickel M.E. Rationale and methods for abductive reasoning in natural-language interpretation. Proc. International Scientific Symposium on Natural Language and Logic. Lecture Notes in Artificial Intelligence. 459:1989;233-252 Springer, Berlin.
55. Wakaki T., Satoh K. Compiling prioritized circumscription into extended logic programs. Proc. IJCAI-97, Nagoya, Japan. 1997;182-187 Morgan Kaufmann, Los Altos, CA.
56. Wang X., You J.-H., Yuan L.-Y. Nonmonotonic reasoning by monotonic inferences with priority constraints. Proc. 2nd International Workshop on Nonmonotonic Extensions of Logic Programming. Lecture Notes in Artificial Intelligence. 1216:1996;91-109 Springer, Berlin.
57. Zang Y., Foo N. Answer sets for prioritized logic programs. Proc. 1997 International Logic Symposium. 1997;69-83 MIT Press, Cambridge, MA.
58. Zang Y., Foo N. Updating logic programs. Proc. 13th European Conference on Artificial Intelligence. 1998;403-407 Wiley, Chichester, UK.