Abstract
The starting point of this paper is Sandewall's conception of using multiple-input and multiple-output operators in problem-solving (see [3]). A formal definition of the general transformation problem is given. The conventional search-tree (or graph) is generalized into a new structure (lattice-structure with a special relation).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
FIKES, R.E.; NILSSON, N.J. STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving, Artificial Intelligence 2 (1971), 189
KELEMEN, J. A generalized approach to problem-solving, (in Slovak), Master Thesis, 1974
SANDEWALL, E.J. Concepts and methods for heuristic search, Proc. Intern. Joint Conf. Artificial Intelligence, Washington, D.C., 1969
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kelemen, J. (1975). A lattice-theoretical approach to problem-solving. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_690
Download citation
DOI: https://doi.org/10.1007/3-540-07162-8_690
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07162-4
Online ISBN: 978-3-540-37492-3
eBook Packages: Springer Book Archive