Approximate pruning in tabled logic programming

Authors:
Luís F. Castro;David S. Warren
Affiliations:
Computer Science Dept., SUNY at Stony Brook;Computer Science Dept., SUNY at Stony Brook
Venue:
ESOP'03 Proceedings of the 12th European conference on Programming
Year:
2003

Citing 7
Cited 2

The craft of Prolog

The craft of Prolog
An abstract machine for SLG resolution: definite programs

ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Efficient evaluation of normal logic programs

Efficient evaluation of normal logic programs
Tabled evaluation with delaying for general logic programs

Journal of the ACM (JACM)
An abstract machine for tabled execution of fixed-order stratified logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
A New Formulation of Tabled Resolution with Delay

EPIA '99 Proceedings of the 9th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
A Simple Scheme for Implementing Tabled Logic Programming Systems Based on Dynamic Reordering of Alternatives

Proceedings of the 17th International Conference on Logic Programming

Just enough tabling

PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
On applying or-parallelism and tabling to logic programs

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pruning provides an important tool for control of nondeterminism in Prolog systems. Current Tabled Prolog systems improve Prolog's evaluation strategy in several ways, but lack satisfactory support for pruning operations. In this paper we present an extension to the evaluation mechanism of Tabled Prolog to support pruning. This extension builds on the concept of demand to select tables to prune. In particular, we concentrate on systems based on SLG resolution. A once operator is described, which approximates demand-based pruning, providing for an efficient implementation in the XSB system.