Advertisement

Using normal deduction graphs in default reasoning

  • Ricardo A. Munoz
  • Chao-Chih Yang
Communications Knowledge Representation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 542)

Abstract

This paper presents a formalization of commonsense reasoning by using normal deduction graphs (NDGs), which form a powerful tool for deriving Horn and non-Horn clauses, based on Kleene's three-valued logic. We show how NDGs, in conjunction with default logic, can be used to answer queries of commonsense reasoning by developing a formalization with results which are consistent with Etherington's ordered network theory. Index terms: Artificial intelligence, commonsense reasoning, default reasoning, first-order logic, inference, logic programming, normal deduction graph.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    de Kleer, J., “An Assumption-based TMS,” Artificial Intelligence, 28 (1986), 127–162.Google Scholar
  2. [2]
    de Kleer, J., “Extending the ATMS,” Artificial Intelligence, 28 (1986), 163–196.Google Scholar
  3. [3]
    Etherington, D. W., Reasoning with Incomplete Information, Morgan Kaufmann, 1988.Google Scholar
  4. [4]
    Etherington, D. W., “Formalizing Nonmonotonic Reasoning Systems,” Artificial Intelligence, 31 (1987), 41–85.Google Scholar
  5. [5]
    Ginsberg, M. L., “A Circumscriptive Theorem Prover,” Artificial Intelligence, 39 (1989), 209–230.Google Scholar
  6. [6]
    Hanks, S. and D. McDermott, “Nonmonotonic Logic and Temporal Projection,” Artificial Intelligence, 33 (1987), 379–412.Google Scholar
  7. [7]
    Horng, W. B. and C. C. Yang, “A Shortest Path Algorithm to find Minimal Deduction Graphs,” Data and Knowledge Engineering, 6 (1991), 27–46, North-Holland.Google Scholar
  8. [8]
    Kleene, S. C., Introduction to Metamathematics, Van Nostrand, New York, 1952.Google Scholar
  9. [9]
    McCarthy, J., “Circumscription — A form of Non-monotonic Reasoning,” Artificial Intelligence, 13 (1980), 27–39.Google Scholar
  10. [10]
    McCarthy, J., “Applications of Circumscription to Formalizing Common-sense Knowledge,” Artificial Intelligence, 28 (1986), 86–116.Google Scholar
  11. [11]
    Reiter, R., “A Logic for Default Reasoning,” Artificial Intelligence, 13 (1980), 81–132.Google Scholar
  12. [12]
    Yang, C. C., “Extending Deduction Graphs for Inferring and Redundancy Checking Function-Free Rules,” presented at Second International Symposium on Methodologies for Intelligent Systems, Colloquia Program, Charlotte, N. C., (Oct. 17, 1987).Google Scholar
  13. [13]
    Yang, C. C., “Deduction Graphs: An Algorithm and Applications,” IEEE Trans. on Software Engineering, 15, 1 (Jan. 1989), 60–67.Google Scholar
  14. [14]
    Yang, C. C., “An Algorithm for Logically Deducing Horn Clauses and Processing Logic Queries,” International J. of Pattern Recognition and Artificial Intelligence, 1, 1 (1987), 157–168.Google Scholar
  15. [15]
    Yang, C. C., J. J. Y. Chen, and H. L. Chau, “Algorithms for Constructing Minimal Deduction Graphs,” IEEE Trans. on Software Engineering, 16, 6 (June 1989), 760–770.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Ricardo A. Munoz
    • 1
  • Chao-Chih Yang
    • 1
  1. 1.Department of Computer SciencesUniversity of North TexasDentonUSA

Personalised recommendations