Tabling Structures for Bottom-Up Logic Programming
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 .
- 1.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.Google Scholar
- 2.John G. Cleary, Mark Utting, and Roger J. Clayton. Data structures considered harmful. In Australasian Workshop on Computational Logic, Feb 2000.Google Scholar