Shortest Path by Approximation in Logic Programs

Research output: Contribution to journalArticle

9 Scopus citations

Abstract

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 languageEnglish (US)
Pages (from-to)119-137
Number of pages19
JournalACM Letters on Programming Languages and Systems (LOPLAS)
Volume1
Issue number2
DOIs
StatePublished - Jan 6 1992

Keywords

  • approximation
  • dynamic programming
  • shortest paths

ASJC Scopus subject areas

  • Software
  • Engineering(all)

Fingerprint Dive into the research topics of 'Shortest Path by Approximation in Logic Programs'. Together they form a unique fingerprint.

  • Cite this