Abstract
Algorithm schemata are a popular research topic. In Section 8.1, we introduce algorithm schemata and argue that they are an important support for guiding algorithm design. Then, in Section 8.2, we introduce a logic algorithm schema reflecting a divide-and-conquer design strategy. This allows us, in Section 8.3, to refine the framework of Chapter 7 to stepwise and schema-guided synthesis of logic algorithms from examples and properties. Future work and related work are discussed in Section 8.4 and Section 8.5, respectively, before drawing some conclusions in Section 8.6.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Flener, P. (1995). Algorithm Analysis and Algorithm Schemata. In: Logic Program Synthesis from Incomplete Information. The Kluwer International Series in Engineering and Computer Science, vol 295. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2205-8_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2205-8_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5925-8
Online ISBN: 978-1-4615-2205-8
eBook Packages: Springer Book Archive