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.
|Original language||English (US)|
|Number of pages||19|
|Journal||ACM Letters on Programming Languages and Systems (LOPLAS)|
|State||Published - Jan 6 1992|
- dynamic programming
- shortest paths
ASJC Scopus subject areas