Abstract
An efficient method for generating derivable objects in calculuses over terms is proposed. The method is based on the fact that inference rules may require only partial information about their premises. It means that we can apply an inference rule not to single terms (or n-tuples of terms, if the rule has n premises) but to sets of terms (sets of n-tuples) whose elements are equivalent to each other with respect to the rule. This may reduce considerably the running time of deduction search algorithms. In some cases this approach even turns infinite search space into finite one.
The proposed method is applicable to a wide range of calculuses. In particular, this method can be used for optimization of logic program execution.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Neiman, V.S. Using partially defined terms in logic inferences. In: Theory and Applications of Artificial Intelligence (Bulgaria, Sozopol, 1989), pp. 241–248 (in Russian)
Kowalski, R. Logic for problem solving (North-Holland, 1979)
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neiman, V.S. (1992). Deduction search with generalized terms. In: Voronkov, A. (eds) Logic Programming. Lecture Notes in Computer Science, vol 592. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55460-2_25
Download citation
DOI: https://doi.org/10.1007/3-540-55460-2_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55460-8
Online ISBN: 978-3-540-47083-0
eBook Packages: Springer Book Archive