Logo image
Tabling structures for bottom-up logic programming
Book chapter   Peer reviewed

Tabling structures for bottom-up logic programming

Roger Clayton, John G Cleary, Bernhard Pfahringer and Mark Utting
Logic Based Program Synthesis and Transformation, pp.50-51
International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR), 12th (Madrid, Spain, 17-Sep-2002–20-Sep-2002)
Lecture Notes in Computer Science (LNCS), 2664, Springer New York LLC
2003
url
https://doi.org/10.1007/3-540-45013-0_5View
Published Version

Abstract

tabling structures 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 [2].

Details

Metrics

2 File views/ downloads
487 Record Views

InCites Highlights

These are selected metrics from InCites Benchmarking & Analytics tool, related to this output

Web Of Science research areas
Computer Science, Theory & Methods
Logo image