OLD resolution with tabulation
Proceedings on Third international conference on logic programming
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
The magic of duplicates and aggregates
Proceedings of the sixteenth international conference on Very large databases
Low complexity aggregation in GraphLog and Datalog
ICDT '90 Proceedings of the third international conference on database theory on Database theory
Minimum and maximum predicates in logic programming
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Communications of the ACM
Monotonic aggregation in deductive databases
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Extension table built-ins for Prolog
Software—Practice & Experience
Communications of the ACM
Aggregation and Relevance in Deductive Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Extension tables for recursive query evaluation
Extension tables for recursive query evaluation
Pushing extrema aggregates to optimize logic queries
Information Systems
Dynamic Programming in Datalog with Aggregates
IEEE Transactions on Knowledge and Data Engineering
Key Constraints and Monotonic Aggregates in Deductive Databases
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
An approximation paradigm is proposed for logic programming as a simple modification to a complete evaluation strategy. The motivational example illustrates how a straigthforward transformation of a declarative specification of the distance between two vertices in a directed graph leads to sophisticated algorithms for computing shortest paths. The goal of the work presented in this paper is not to provide a more efficient computation of shortest paths but to investigate how the intermediate tables, known as extension tables, generated by the complete evaluation strategy might be used in approximation algorithms. We present the ETdistance algorithm in perspective, its execution is compared to those of Dijkstra's single-source and Floyd's all-pairs shortest path algorithms.