This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Computationally Tractable Nonmonotonic Logic
February 1994 (vol. 6 no. 1)
pp. 57-63

Nonmonotonic logic is intended to apply specifically to situations where the initial information is incomplete. Using nonmonotonic reasoning procedures we shall be able to jump to conclusions, but withdraw them later when we gain additional information. A number of nonmonotonic logics have been introduced and widely discussed. Nonmonotonic logics tend to be introduced proof theoretically, and little attention is paid to their semantic characteristics or their computational tractability. We address both of these issues by presenting a nonmonotonic logic for the Herbrand subset of first-order predicate logic. This nonmonotonic logic is shown to be both sound and complete. Theories formulated in this logic can be executed in logic programming fashion.

[1] K. R. Apt and M. H. van Emden, "Contributions to the theory of logic programming,"JACM, vol. 29, pp. 841-862, 1982.
[2] C. L. Chang and R. C. T. Lee,Symbolic Logic and Mechanical Theorem Proving. New York: Academic, 1973.
[3] K. L. Clark, "Negation as failure," inLogic and Databases, H. Gallaire, J. Minker, Eds. New York: Plenum, pp. 293-322, 1978.
[4] M. Davis, "The mathematics of nonmonotonic reasoning," Artificial Intell., vol. 13, pp. 73-80, 1980.
[5] D. W. Etherington and R. Reiter, "On inheritance hierarchies with exceptions," inProc. 3rd AAAI, Washington, 1983, pp. 104-108.
[6] D. W. Etherington, "More on inheritance hierarchies with exceptions," inProc. 6th AAAI. Seattle, 1987, pp. 352-357.
[7] D. W. Etherington, "Formalizing nonmonotonic reasoning systems,"Art. Intell., vol. 31, pp. 41-85, 1987.
[8] M. Gelfond and V. Lifschitz, "Compiling circumscriptive theories into logic programs," inProc. 2nd Int. Workshop Non-monotonic Reasoning, Springer LNAI 346, 1988, pp. 74-99.
[9] M.R. Genesereth and N.J. Nilsson,Logical Foundations of Artificial Intelligence, Morgan Kaufmann, San Mateo, Calif., 1987.
[10] M. L. Ginsberg,Readings in Nonmonotonic Reasoning, Palo Alto, CA: Morgan Kaufmann, 1987.
[11] J. Horty, R. H. Thomason, and D. Touretzky, "A skeptical theory of inheritance in nonmonotonic semantic networks," inProc. 6th AAAI, Seattle, 1987, pp. 358-363.
[12] J. L. Lassez and M. J. Maher, "Closure and fairness in the semantics of programming logic,"Theoretical Comput. Science, vol. 4, 1985.
[13] V. Lifschitz, "Computing circumscription," inProc. 9th IJCAI, Los Angeles, CA, 1985, pp. 121-127.
[14] V. Lifschitz, "Pointwise circumscription," inReadings in Nonmonotonic Reasoning, M. Ginsberg, Ed. Los Altos, CA: Morgan Kaufmann, 1987, pp. 179-194.
[15] J. W. Lloyd,Foundations of Logic Programming, New York: Springer, 1984.
[16] J. McCarthy, "First-order theories of individual concepts and propositions," inMachine Intelligence, vol. 9, D. Mitchie, Ed. Edinburgh: Univ. Edinburgh Press, 1979.
[17] J. McCarthy, "Circumscription--A form of nonmonotonic reasoning,"Art. Intell., vol. 13, pp. 27-39, 1980.
[18] McCarthy, J., 1986. "Applications of Circumscription to Formalizing Common Sense Knowledge."Artificial Intelligence, April 1986.
[19] D. McDermott and J. Doyle, "Nonmonotonic logic I,"Art. Intell., vol. 13, pp. 27-39, 1980.
[20] D. V. McDermott, "Non-monotonic logic, II: Non-monotonic modal theories,"J. Ass. Comput. Mach., vol. 29, pp. 33-57, 1982.
[21] R. Moore, "Semantical considerations on nonmonotonic logic,"Art. Intell., vol. 25, pp. 75-94, 1985.
[22] R. Reiter, "A logic for default reasoning,"Artificial Intell., vol. 13, pp. 81-132, 1980.
[23] R. Reiter, "Circumscription implies predicate completion (sometimes)." inProc. 2nd Natl. Conf. Artificial Intell., San Francisco, 1982, pp. 418-420.
[24] Y. Shoham, "A semantical approach to nonmonotonic logic," inReadings in Nonmonotonic Reasoning, M. Ginsberg, Ed. Los Altos: Morgan Kaufmann, 1987, pp. 227-250.
[25] A. Tarski, "A lattice-theoretical fixpoint theorem and its applications,"Pacific J. Math., vol. 5, pp. 285-309, 1955.
[26] J. J. P. Tsai, T. Weigert and H. C. Jang, "A hybrid knowledge representation as a basis of requirement specification and analysis,"IEEE Trans. Sofware Eng., vol. 18, no. 12, pp. 1076-1100. Dec. 1992.
[27] J. J. P. Tsai, T. Weigert and M. Aoyama, "A declarative approach to software requirement specification languages," inProc. IEEE Computer Languages Conf., Oct. 1988, pp. 414-421.
[28] J. J.-P. Tsai and T. Weigert, "ECLIE: A logic-based requirements language for new software engineering paradigms,"IEE Software Engineering J., vol. 6, pp. 137-151, July 1991.
[29] J. J. P. Tsai and T. Weigert,Knowledge-Based Software Development for Real-Time Distributed Systems. World Scientific, 1993.
[30] T. Weigert, "A non-monotonic extension to Horn-clause logic," Logical Calculi for Reasoning in the Presence of Uncertainty, Ph.D. dissertation, Dept. of Philosophy, Univ. of Illinois, Chicago, 1990.

Index Terms:
nonmonotonic reasoning; logic programming; formal logic; computationally tractable nonmonotonic logic; incomplete information; nonmonotonic reasoning procedures; proof theoretically; semantic characteristics; Herbrand subset; first-order predicate logic; logic programming; knowledge representation; reasoning
Citation:
T.J. Weigert, J.J.-P. Tsai, "A Computationally Tractable Nonmonotonic Logic," IEEE Transactions on Knowledge and Data Engineering, vol. 6, no. 1, pp. 57-63, Feb. 1994, doi:10.1109/69.273025
Usage of this product signifies your acceptance of the Terms of Use.