Abstract
An algorithm for answer extraction in resolution-based systems is presented. The algorithm, an extension of the Luckham-Nilsson algorithm, accomplishes the answer extraction in a single traversal of the proof graph without requiring the appending of tautologies to clauses from the negation of the theorem. It enables realization of a significant savings in time and space resources. In addition, an extension to the algorithm is described by which some types of multiple answers to Wh and counting type questions can be obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Bennett, “Answer and Reason Extraction in Theorem Proving,” Scholarly Paper 117, Computer Science Center, University of Maryland, College Park, Maryland (1973).
J. L. Darlington, “Theorem Provers as Question Answerers,”Proceedings of the International Joint Conference on Artificial Intelligence (Washington, D.C., May 7–9, 1969).
D. J. Fishman and J. Minker, “π-Representation: A clause representation for parallel search,”Artif. Intell. 6(2):103–127 (Summer 1975).
C. C. Green, “Theorem Proving by Resolution as a Basis for Question-Answering Systems,” inMachine Intelligence 4, B. Meltzer and D. Michie, Eds. (American Elsevier, New York, 1969), pp. 193–205.
R. B. Kieburtz and D. Luckham, “Compatibility and complexity of refinements of the resolution principle,”Soc. Ind. Appl. Math. J. Comput. 1(4):313–332 (December 1972).
D. Knuth,The Art of Computer Programming: Fundamental Algorithms (Addison-Wesley, Reading, Massachusetts, 1973).
R. Kowalski and D. Kuehner, “Linear resolution with selection function,”Artif. Intell. 2(3/4):221–260 (1971).
D. Luckham and N. J. Nilsson, “Extracting information from resolution proof trees,”Artif. Intell. 2(1):198–213(Spring 1971).
J. R. McSkimin, “Techniques for Employing Semantic Information in Relational Systems,” Ph.D. thesis, University of Maryland, College Park, Maryland (1976).
G. W. Wilson, “The PAR Technique-An Approach for Parallel Inference and Parallel Search in Problem Solving Systems,” Ph.D. thesis, University of Maryland, College Park, Maryland (1976).
Author information
Authors and Affiliations
Additional information
This work was supported by funds from National Aeronautics and Space Administration, Grant NGR21-002-270, Supplement 5, to the University of Maryland.
Rights and permissions
About this article
Cite this article
Minker, J., Wilson, G.A. A note on answer extraction in resolution-based systems. International Journal of Computer and Information Sciences 6, 179–192 (1977). https://doi.org/10.1007/BF01002330
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01002330