Handling incomplete and complete tables in tabled logic programs

Authors:
Ricardo Rocha
Affiliations:
DCC-FC & LIACC, University of Porto, Portugal
Venue:
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Year:
2006

Citing 2
Cited 1

Just enough tabling

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

ECML'05 Proceedings of the 16th European conference on Machine Learning

The yap prolog system

Theory and Practice of Logic Programming - Prolog Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of the recent proposals in tabling technology were designed as a means to improve the performance of particular applications in key aspects of tabled evaluation like re-computation and scheduling. The discussion we address in this work was also motivated by our recent attempt [1] of applying tabling to Inductive Logic Programming (ILP) [2]. ILP applications are very interesting for tabling because they have huge search spaces and do a lot of re-computation. Moreover, we found that they are an excellent case study to improve some practical limitations of current tabling execution models. In particular, we next focus on the table space and how to efficiently handle incomplete and complete tables.