Abstract
In the past the LOPS-approach has been applied to synthesize algorithms for the computation of elements or subsets of a given set. This paper outlines how the basic ideas of LOPS can be used for the synthesis of algorithms for problems which are of a different nature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. Bibel, U. Furbach, J.F. Schreiber: Strategies for the Synthesis of Algorithms, 5-te Fachtagung über Programmiersprachen der GI, March 1978.
W. Bibel: Syntax-directed, semantics-supported program synthesis, Artificial Intelligence 14 (1980).
W. Bibel, K.M. Hörnig: LOPS - a system based on a strategical approach to program synthesis, in: Automatic program construction techniques, ( A. Biermann, G. Guiho, Y. Kodratoff, eds.), MacMillan, New York 1984.
A.W. Biermann: Automatic Programming: a tutorial on formal methodologies, (invited lecture), EUROCAL 85
B. Fronhöfer: Heuristics for recursion improvement, Proceedings of ECAI-84, (T.O’Shea, ed.), North-Holland, Amsterdam 1984.
B. Fronhöfer, R. Caferra, P. Jacquet: Improvement of recursive programs from a logic programming point of view, GWAI-84, (J. Laubsch, ed.), Informatik-Fachberichte, Springer, Berlin 1984.
G. Guiho, C. Gresse: Program Synthesis from Incomplete Specifications, 5th Conference on Automated Deduction, LesArcs, France, 1980, LNCS 87.
C. Hogger: Derivation of logic programs, JACM 28, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fronhöfer, B. (1985). The Lops-Approach: Towards New Syntheses of Algorithms. In: Trost, H., Retti, J. (eds) Österreichische Artificial Intelligence-Tagung. Informatik-Fachberichte, vol 106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46552-9_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-46552-9_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-15695-6
Online ISBN: 978-3-642-46552-9
eBook Packages: Springer Book Archive