Abstract
Generally logic programs are considered more abstract than programs written in other paradigms. Yet most logic programs are strongly dependent on programmer-defined data structures - such as lists in Prolog. Logic programs often become saturated with data structure manipulation code which obscures the original problem and requires large-scale rewriting to change data representations. To avoid this, the logic programming language Starlog provides a data-structure-free environment where data is stored relationally in tuples and programs are evaluated bottom-up [2].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Roger Clayton, John G. Cleary, Bernhard Pfahringer, and Mark Utting. Optimising tabling structures for bottom-up logic programming. Technical Report, University of Waikato, Sept 2002.
John G. Cleary, Mark Utting, and Roger J. Clayton. Data structures considered harmful. In Australasian Workshop on Computational Logic, Feb 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clayton, R., Cleary, J.G., Pfahringer, B., Utting, M. (2003). Tabling Structures for Bottom-Up Logic Programming. In: Leuschel, M. (eds) Logic Based Program Synthesis and Transformation. LOPSTR 2002. Lecture Notes in Computer Science, vol 2664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45013-0_5
Download citation
DOI: https://doi.org/10.1007/3-540-45013-0_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40438-5
Online ISBN: 978-3-540-45013-9
eBook Packages: Springer Book Archive