Foundations of logic programming
Foundations of logic programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Model-based diagnosis preferences and strategies representation with logic meta-programming
Meta-logics and logic programming
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)
Optimizing existential datalog queries
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Well-founded abduction via tabled dual programs
Proceedings of the 1999 international conference on Logic programming
Tabling for non-monotonic programming
Annals of Mathematics and Artificial Intelligence
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
Improving the Alternating Fixpoint: The Transformation Approach
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
XSB: A System for Effciently Computing WFS
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
The Limits of Fixed-Order Computation
LID '96 Proceedings of the International Workshop on Logic in Databases
Approximate pruning in tabled logic programming
ESOP'03 Proceedings of the 12th European conference on Programming
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Xsb: Extending prolog with tabled logic programming
Theory and Practice of Logic Programming - Prolog Systems
Query-Driven Procedures for Hybrid MKNF Knowledge Bases
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Tabling has become important to logic programming in part because it opens new application areas, such as model checking, to logic programming techniques. However, the development of new extensions of tabled logic programming is becoming restricted by the formalisms that underly it. Formalisms for tabled evaluations, such as SLG [3], are generally developed with a view to a specific set of allowable operations that can be performed in an evaluation. In the case of SLG, tabling operations are based on a variance relation between atoms. While the set of SLG tabling operations has proven useful for a number of applications, other types of operations, such as those based on a subsumption relation between atoms, can have practical uses. In this paper, SLG is reformulated in two ways: so that it can be parameterized using different sets of operations; and so that a forest of trees paradigm is used. Equivalence to SLG of the new formulation, Extended SLG or SLGX, is shown when the new formalism is parameterized by variant-based operations. In addition, SLGX is also parameterized by subsumption-based operations and shown correct for queries to the well-founded model. Finally, the usefulness of the forest of trees paradigm for motivating tabling optimizations is shown by formalizing the concept of relevance within a tabled evaluation.