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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
de Kleer, J., “An Assumption-based TMS,” Artificial Intelligence, 28 (1986), 127–162.
de Kleer, J., “Extending the ATMS,” Artificial Intelligence, 28 (1986), 163–196.
Etherington, D. W., Reasoning with Incomplete Information, Morgan Kaufmann, 1988.
Etherington, D. W., “Formalizing Nonmonotonic Reasoning Systems,” Artificial Intelligence, 31 (1987), 41–85.
Ginsberg, M. L., “A Circumscriptive Theorem Prover,” Artificial Intelligence, 39 (1989), 209–230.
Hanks, S. and D. McDermott, “Nonmonotonic Logic and Temporal Projection,” Artificial Intelligence, 33 (1987), 379–412.
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.
Kleene, S. C., Introduction to Metamathematics, Van Nostrand, New York, 1952.
McCarthy, J., “Circumscription — A form of Non-monotonic Reasoning,” Artificial Intelligence, 13 (1980), 27–39.
McCarthy, J., “Applications of Circumscription to Formalizing Common-sense Knowledge,” Artificial Intelligence, 28 (1986), 86–116.
Reiter, R., “A Logic for Default Reasoning,” Artificial Intelligence, 13 (1980), 81–132.
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).
Yang, C. C., “Deduction Graphs: An Algorithm and Applications,” IEEE Trans. on Software Engineering, 15, 1 (Jan. 1989), 60–67.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Munoz, R.A., Yang, CC. (1991). Using normal deduction graphs in default reasoning. In: Ras, Z.W., Zemankova, M. (eds) Methodologies for Intelligent Systems. ISMIS 1991. Lecture Notes in Computer Science, vol 542. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54563-8_84
Download citation
DOI: https://doi.org/10.1007/3-540-54563-8_84
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54563-7
Online ISBN: 978-3-540-38466-3
eBook Packages: Springer Book Archive