This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Nonmonotonic Logic Programming
January/February 1999 (vol. 11 no. 1)
pp. 143-152

Abstract—This paper provides a survey of the state of the art in nonmonotonic logic programming. In particular, we survey advances in the declarative semantics of logic programs, in query processing procedures for nonmonotonic logic programs, and in recent extensions of the nonmonotonic logic programming paradigm.

[1] J.J. Alferes and L.M. Pereira, "Reasoning With Logic Programming," Springer Lecture Notes in Artificial Intelligence 1,111, 1996.
[2] K. Apt, H.A. Blair, and A. Walker, "Towards a Theory of Declarative Knowledge," Foundations of Deductive Databases and Logic Programming, J. Minker, ed., pp. 89-148. Morgan Kaufmann, 1988.
[3] C. Baral and V.S. Subrahmanian, "Dualities Between Alternative Semantics for Logic Programming and Non-Monotonic Reasoning," J. Automated Reasoning, vol. 10, pp. 399-420, 1993.
[4] C. Bell, A. Nerode, R. Ng, and V.S. Subrahmanian, "Implementing Deductive Databases by Linear Programming," Proc. ACM SIGACT/SIGART/SIGMOD Symp. Principles of Database Systems, pp. 283-292, 1992. Available as Univ. of Maryland Technical Report CS-TR-2747, 1991.
[5] C. Bell, A. Nerode, R. Ng, and V.S. Subrahmanian, "Computation and Implementation of Nonmonotonic Deductive Databases," J. ACM, vol. 41, no. 6, pp. 1,178-1,215, 1994.
[6] K. Berman, J. Schlipf, and J. Franco, "Computing the Well Founded Semantics Faster," Proc. Third Int'l Conf. on Logic Programming and Nonmonotonic Reasoning, Springer Lecture Notes in Artificial Intelligence 928, pp. 113-126, 1995.
[7] S. Jajodia, P. Samarati, V.S. Subrahmanian, and E. Bertino, “A Unified Framework for Enforcing Multiple Access Control Policies,” Proc. ACM SIGMOD Int'l Conf. Management of Data, pp. 474–485, May 1997.
[8] H.A. Blair and V.S. Subrahmanian, “Paraconsistent Logic Programming,” Theoretical Computer Science, vol. 68, pp. 135-154, 1989.
[9] F. Buccafurri, N. Leone, and P. Rullo, "Stable Models and Their Computation for Logic Programming with Inheritance and True Negation," J. Logic Programming, vol. 27, no. 1, pp. 5-43, Apr. 1996.
[10] L. Cavedon and J.W. Lloyd, "Completeness Theorem for SLDNF Resolution," J. Logic Programming, vol. 7, no. 3, pp. 177-191, Nov. 1989.
[11] L. Cavedon, "Cyclic Logic Programs and the Completeness of SLDNF-Resolution," Theoretical Computer Science, vol. 86, no. 1, pp. 81-92, Aug. 1991.
[12] D. Chan, "Constructive Negation Based on the Completed Database," Proc. Fifth Int'l Conf./Symp. on Logic Programming, pp. 111-125, MIT Press, 1988.
[13] W. Chen, "Query Evaluation of Alternating Fixpoint Logic," ACM Trans. Database Systems, vol. 20, no. 3, pp. 239-287, 1995.
[14] W. Chen, T. Swift, and D.S. Warren, "Efficient Top-Down Computation of Queries Under the Well-Founded Semantics,"1 J. Logic Programming, vol. 24, no. 3, pp. 161-199, Sept. 1995.
[15] W. Chen and D.S. Warren, "Computation of Stable Models and its Integration with Logical Query Processing," IEEE Trans. Knowledge and Data Eng., vol. 8, no. 5, pp. 742-757, Oct. 1996.
[16] W. Chen and D.S. Warren, "Tabled Evaluation with Delaying for General Logic Programs," J. ACM, vol. 43, no. 1, pp. 20-74, Jan. 1996.
[17] K.L. Clark, "Negation as Failure," Logic and Database, H. Gallaire and J. Minker, eds., Plenum Press, 1997.
[18] S. Costantini, "Contributions to the Stable Model Semantics of Logic Programs with Negation," Theoretical Computer Science, vol. 150, no. 2, pp. 231-255; preliminary version, Proc. LPNMR, L.M. Pereira and A. Nerode, eds., Lisbon, MIT Press, June 1994.
[19] J. Cuadrado and S. Pimentel, "A Truth Maintenance System Based on Stable Models," Proc. 1989 North Am. Conf. Logic Programming, pp. 274-290, 1989.
[20] Proc. Fourth Int'l Conf. Logic Programming and Non-Monotonic Reasoning, Lecture Notes in Artificial Intelligence 1,265, J. Dix, U. Furbach, and A. Nerode, eds., Springer-Verlag, 1997.
[21] J. Dix and M. Müller, "Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties," Proc. LPNMR, L.M. Pereira and A. Nerode, eds., pp. 43-59, 1993.
[22] J. Dix and F. Stolzenburg, "Computation of Non-Ground Disjunctive Well-Founded Semantics with Constraint Logic Programming," J. Dix, L.M. Pereira, and T.C. Przymusinski, eds, Proc. WS Non-Monotonic Extensions of Logic Programming (during JICSLP), pp. 143-160, CS-Report 17/96, Univ. of Koblenz, 1996.
[23] J. Doyle, "A Truth Maintenance System," Artificial Intelligence, vol. 12, pp. 231-272, 1979.
[24] W. Drabent, "SLS Resolution Without Floundering, Proc. Second Int'l Workshop on Logic Programming and Nonmonotonic Reasoning, pp. 82-97, MIT Press, 1993.
[25] T. Eiter, J. Lu, and V.S. Subrahmanian, "Computing Non-Ground Representations of Stable Models," Proc. Fourth Int'l Conf. Logic Programming and Non-Monotonic Reasoning, pp. 198-217, Lecture Notes in Artificial Intelligence 1,265, J. Dix, U. Furbach, and A. Nerode, eds., Springer-Verlag, 1997.
[26] T. Eiter, N. Leone, C. Mateis, G. Pfeifer, and F. Scarcello, “A Deductive System for Non-Monotonic Reasoning,” Proc. Int'l Conf. Logic Programming and Nonmonotonic Reasoning, pp. 363-374, 1997.
[27] T. Eiter and G. Gottlob, "Complexity Aspects of Various Semantics for Disjunctive Databases," Proc. 12th ACM SIGACT SIGMOD-SIGART Symp. Principles of Database Systems (PODS-93), pp. 158-167, June 1993.
[28] T. Eiter, G. Gottlob, and H. Mannila, "Adding Disjunction to Datalog," Proc. 13th ACM SIGACT SIGMOD-SIGART Symp. Principles of Database Systems (PODS-94), pp. 267-278, May 1994.
[29] T. Eiter and G. Gottlob, "The Complexity of Logic-Based Abduction," J. ACM, vol. 42, no. 1, pp. 3-42, Jan. 1995.
[30] T. Eiter, V.S. Subrahmanian, and G. Pick, "Heterogeneous Active Agents," Univ. of Maryland Technical Report CS-TR-3880, Mar. 1998; submitted for journal publication.
[31] J. Fernandez, J. Lobo, J. Minker, and V.S. Subrahmanian, "Disjunctive LP + Integrity Constraints = Stable Model Semantics," Annals of Math. and Artificial Intelligence, vol. 8, pp. 449-474, 1993.
[32] M.C. Fitting, "A Kripke-Kleene Semantics for Logic Programming," J. Logic Programming, vol. 4, pp. 295-312, 1985.
[33] H. Gallaire and J. Minker, Logic and Databases, Plenum Press, New York, 1976.
[34] M. Gelfond and V. Lifschitz, "The Stable Model Semantics for Logic Programming," Proc. Fifth Int'l Conf. and Symp. Logic Programming, R.A. Kowalski and K.A. Bowen, eds., pp. 1,070-1,080, 1988.
[35] M. Gelfond and V. Lifschitz (1990), “Logic Programs with Classical Negation,” Proc. of the 7th Intl. Conf. on Logic Programming, pp. 579-597, MIT Press.
[36] L. Giordano, A. Martelli, and M.L. Sapino, "Extending Negation as Failure by Abduction: A Three-Valued Stable Model Semantics," J. Logic Programming, vol. 26, no. 1, pp. 31-67, Jan. 1996.
[37] G. Gottlob, "Complexity Results for Nonmonotonic Logics," J. Logic and Computation, vol. 2, no. 3, pp. 397-425, June 1992.
[38] G. Gottlob, "The Complexity of Default Reasoning Under the Stationary Fixed Point Semantics," Information and Computation, vol. 121, no. 1, pp. 81-92, Aug. 1995.
[39] G. Gottlob, "Translating Default Logic into Standard Autoepistemic Logic," J. ACM, vol. 42, no. 4, pp. 711-740, July 1995.
[40] G. Gottlob, S. Marcus, A. Nerode, G. Salzer, and V.S. Subrahmanian, "A Non-Ground Realization of the Stable and Well-Founded Semantics," Theoretical Computer Science, vol. 166, pp. 221-262, 1996.
[41] R.G. Jeroslow, "Computation-oriented reductions of predicate to propositional logic," Decision Support Systems, vol. 4, pp. 183-197, 1988.
[42] R.E. Jeroslow, Logic-Based Decision Support: Mixed Integer Model Formulation, NorthHolland, 1989.
[43] V. Kagan, A. Nerode, and V.S. Subrahmanian, "Computing Definite Logic Programs by Partial Instantiation," Annals Pure and Applied Logic, vol. 67, pp. 161-182, 1994.
[44] V. Kagan,A. Nerode,, and V.S. Subrahmanian,“Computing minimal models by partial instantiation,” 1993, accepted for publication in Theoretical Computer Science.
[45] A.C. Kakas, R.A. Kowalski, and F. Toni, "Abductive Logic Programming," J. Logic and Computation, vol. 2, no. 6, pp. 719-770, Dec. 1992.
[46] A.C. Kakas and C. Mourlas, "ACLP: Flexible Solutions to Complex Problems," Proc. Fourth Int'l Conf. Logic Programming and Non-Monotonic Reasoning, Lecture Notes in Artificial Intelligence 1,265, pp. 387-398, J. Dix, U. Furbach, and A. Nerode, eds., Springer-Verlag, 1997.
[47] P.T. Kandzia, "Non-Monotonic Reasoning in FLORID," Proc. Fourth Int'l Conf. Logic Programming and Non-Monotonic Reasoning, Lecture Notes in Artificial Intelligence 1,265, pp. 399-409, J. Dix, U. Furbach, and A. Nerode, eds., Springer-Verlag, 1997.
[48] D. Kemp, P.J. Stuckey, and D. Srivastava, "Magic Sets and Bottom-Up Evaluation of Well-Founded Models," Proc. 1991 Int'l Logic Programming Symp., pp. 337-351, V. Saraswat and K. Ueda, eds., MIT Press, 1991.
[49] J. Lu, A. Nerode, and V.S. Subrahmanian, "Hybrid Knowledge Bases," IEEE Trans. Knowledge and Data Eng., vol. 8, no. 5, pp. 773-785, Oct. 1996.
[50] N. Leone and P. Rullo,“Safe computation of the well-founded semantics of DATALOG queries,” Information Systems, vol. 17, no. 1, 1992.
[51] N. Leone, M. Romeo, P. Rullo, and D. Sacca, "Effective Implementation of Negation in Database Logic Query Languages," LOGIDATA+: Deductive Databases with Complex Objects, Lecture Notes in Computer Science 701, pp. 159-175, Springer, 1993.
[52] V. Lifschitz, N. McCain, T.C. Przymusinski, and R.F. Stark, "Loop Checking and the Well Founded Semantics, Proc. Third Int'l Conf. on Logic Programming and Nonmonotonic Reasoning, pp. 127-142, Springer Lecture Notes in Artificial Intelligence 928, 1995.
[53] J.W. Lloyd, Foundations of Logic Programming, Springer, 1987.
[54] J. Lobo, J. Minker, and A. Rajasekar, Foundations of Disjunctive Logic Programming. Cambridge, Mass.: MIT Press, 1992.
[55] W. Marek, A. Nerode, and J. Remmel, "A Theory of Nonmonotonic Rule Systems," vol. I, Annals Math. and Artificial Intelligence, 1991.
[56] W. Marek, A. Nerode, and J. Remmel, "The Stable Models of a Predicate Logic Program," J. Logic Programming, vol. 21, no. 3, 1994.
[57] W. Marek, A. Nerode, and J. Remmel, "On Logical Constraints in Logic Programming," Proc. LPNMR, W. Marek, A. Nerode, and${\rm M.\ Truszczy {\acute n} ski},$eds., pp. 44-56, Lecture Notes in Computer Science 928, 1995.
[58] W. Marek, A. Nerode, and M. ${\rm Truszczy {\acute n} ski}$, Proc. Third Int'l Conf. on Logic Programming and Nonmonotonic Reasoning, Springer Lecture Notes in Artificial Intelligence 928, 1995.
[59] W. Marek and V.S. Subrahmanian, "The Relationship Between Stable, Supported, Default and Auto-Epistemic Semantics for General Logic Programs," Theoretical Computer Science, vol. 103, pp. 365-386, 1992.
[60] W. Marek, G.G. Schwarz, and M. ${\rm Truszczy {\acute n} ski}$, "Modal NonMonotonic Logics: Ranges, Characterization, Computation," J. ACM, vol. 40, no. 4, pp. 963-990, Sept. 1993.
[61] W. Marek and M. ${\rm Truszczy {\acute n} ski}$, Nonmonotonic Logic: Context Dependent Reasoning, Springer Verlag, Berlin, 1993.
[62] J. Minker,“On indefinite databases and the closed world assumption,” Proc. Automated Deduction Conf., pp. 292-308, 1982.
[63] Foundations of Deductive Databases and Logic Programming, J. Minker, ed., Morgan Kaufman, 1988.
[64] J. Minker, "An Overview of Nonmonotonic Reasoning and Logic Programming," J. Logic Programming, vol. 17, nos. 2/3-4, pp. 95-126, Nov. 1993.
[65] R.C. Moore, "Semantical Considerations on Nonmonotonic Logic," Artificial Intelligence, vol. 25, pp. 75-94, 1985.
[66] A. Nerode, W. Marek, and V.S. Subrahmanian, Proc. First Int'l Workshop on Logic Programming and Nonmonotonic Reasoning, MIT Press, 1991.
[67] G. Neugebauer and D. Schaffer, "GLUE: Opening the World to Theorem Provers," Proc. Fourth Int'l Conf. Logic Programming and Non-Monotonic Reasoning, pp. 420-429, Lecture Notes in Artificial Intelligence 1,265, J. Dix, U. Furbach, and A. Nerode, eds., Springer-Verlag, 1997.
[68] I. Niemel and P. Simons, "Smodels—An Implementation of the Stable Model and Well-Founded Semantics for Normal LP," Proc. Fourth Int'l Conf. Logic Programming and Non-Monotonic Reasoning, pp. 410-419, Lecture Notes in Artificial Intelligence 1,265, J. Dix, U. Furbach, and A. Nerode, eds., Springer-Verlag, 1997.
[69] Y. Peng and J. Reggia, "A Connectionist Model for Diagnostic Problem Solving," IEEE Trans. Systems, Man, and Cybernetics, vol. 19, no. 2, pp. 285-298, 1989.
[70] L.M. Pereira and A. Nerode, Proc. Second Int'l Workshop on Logic Programming and Nonmonotonic Reasoning, MIT Press, 1993.
[71] T.C. Przymusinski, "On the Declarative Semantics of Deductive Databases and Logic Programs," J. Minker, ed., Foundations of Deductive Databases and Logic Programming, pp. 193-216. Morgan Kaufmann, 1988.
[72] P. Rao, K. Sagonas, T. Swift, D. Warren, and J. Freire, "XSB: A System for Efficiently Computing WFS," Proc. Fourth Int'l Conf. Logic Programming and Non-Monotonic Reasoning, pp. 430-440, Lecture Notes in Artificial Intelligence 1,265, J. Dix, U. Furbach, and A. Nerode, eds., Springer-Verlag, 1997.
[73] R. Reiter, "On Closed World Databases," Logic and Databases, Plenum Press, New York, pp. 55-78, 1977.
[74] R. Reiter, "A Logic for Default Reasoning," Artificial Intelligence, vol. 13, pp. 81-132, 1980.
[75] D. Saccà and C. Zaniolo, "Stable Models and Non-determinism for Logic Programs with Negation," ACM SIGACT-SIGMOD-SIGART Symp. Principles of Database Systems, pp. 205-217, 1990.
[76] T. Schaub and P. Nicolas, "An Implementation Platform for Query-Answering: X-RAY," Proc. Fourth Int'l Conf. Logic Programming and Non-Monotonic Reasoning, pp. 441-452, Lecture Notes in Artificial Intelligence 1,265, J. Dix, U. Furbach, and A. Nerode, eds., Springer-Verlag, 1997.
[77] J. Shoenfield, Math. Logic, Addison-Wesley, 1967.
[78] V.S. Subrahmanian, D. Nau, and C. Vago, "WFS + Branch and Bound = Stable Models," IEEE Trans. Knowledge and Data Eng., vol. 7, no. 3, pp. 362-377, 1994.
[79] A. Tarski, "A Lattice Theoretical Fixpoint Theorem and its Applications," Pacific J. Math., vol. 5, pp. 285-309, 1955.
[80] J.J.P. Tsai, T. Weigert, and H. Jang, "A Hybrid Knowledge Representation as a Basis of Requirements Specification and Specification Analysis," IEEE Trans. Software Eng., pp. 1,076-1,100, vol. 18, no. 12, Dec. 1992.
[81] A. van Gelder, "The Alternating Fixpoint of Logic Programs with Negation," Proc. ACM Symp. Principles of Database Systems, pp. 1-10, 1989.
[82] A. van Gelder,K. Ross, and J.S. Schlipf,"The well-founded semantics for general logic programs," J. ACM, vol. 38, no. 3, pp. 620-650, July 1991.
[83] U. Zukowski and B. Freitag, "A Deductive System for Non-Monotonic Reasoning," Proc. Fourth Int'l Conf. Logic Programming and Non-Monotonic Reasoning, pp. 375-386, Lecture Notes in Artificial Intelligence 1,265, J. Dix, U. Furbach, and A. Nerode, eds., Springer-Verlag, 1997.

Index Terms:
Nonmonotonic reasoning, logic programming, deductive databases, negation, incomplete information.
Citation:
V.s. Subrahmanian, "Nonmonotonic Logic Programming," IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 1, pp. 143-152, Jan.-Feb. 1999, doi:10.1109/69.755623
Usage of this product signifies your acceptance of the Terms of Use.