Shortest path by approximation in logic programs

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

An approximation paradigm is proposed for logic programming as a simple modification to a complete evaluation strategy. The motivational example illustrates how a straightforward 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, which computes single-source and all-pairs shortest paths over a declarative logic program. The ETdistance algorithm takes advantage of the dynamic programming property of shortest paths and the ability of extension tables to store global information to converge to the optimal solution. To put 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
Volume1
Issue number2
DOIs
StatePublished - Jun 1992

Fingerprint

Logic programming
Directed graphs
Approximation algorithms
Dynamic programming
Specifications

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Shortest path by approximation in logic programs. / Dietrich, Suzanne.

In: ACM letters on programming languages and systems, Vol. 1, No. 2, 06.1992, p. 119-137.

Research output: Contribution to journalArticle

@article{117427e3783e49b1b890b46edcc8c486,
title = "Shortest path by approximation in logic programs",
abstract = "An approximation paradigm is proposed for logic programming as a simple modification to a complete evaluation strategy. The motivational example illustrates how a straightforward 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, which computes single-source and all-pairs shortest paths over a declarative logic program. The ETdistance algorithm takes advantage of the dynamic programming property of shortest paths and the ability of extension tables to store global information to converge to the optimal solution. To put the ETdistance algorithm in perspective, its execution is compared to those of Dijkstra's single-source and Floyd's all-pairs shortest path algorithms.",
author = "Suzanne Dietrich",
year = "1992",
month = "6",
doi = "10.1145/151333.151377",
language = "English (US)",
volume = "1",
pages = "119--137",
journal = "ACM letters on programming languages and systems",
issn = "1057-4514",
number = "2",

}

TY - JOUR

T1 - Shortest path by approximation in logic programs

AU - Dietrich, Suzanne

PY - 1992/6

Y1 - 1992/6

N2 - An approximation paradigm is proposed for logic programming as a simple modification to a complete evaluation strategy. The motivational example illustrates how a straightforward 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, which computes single-source and all-pairs shortest paths over a declarative logic program. The ETdistance algorithm takes advantage of the dynamic programming property of shortest paths and the ability of extension tables to store global information to converge to the optimal solution. To put the ETdistance algorithm in perspective, its execution is compared to those of Dijkstra's single-source and Floyd's all-pairs shortest path algorithms.

AB - An approximation paradigm is proposed for logic programming as a simple modification to a complete evaluation strategy. The motivational example illustrates how a straightforward 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, which computes single-source and all-pairs shortest paths over a declarative logic program. The ETdistance algorithm takes advantage of the dynamic programming property of shortest paths and the ability of extension tables to store global information to converge to the optimal solution. To put the ETdistance algorithm in perspective, its execution is compared to those of Dijkstra's single-source and Floyd's all-pairs shortest path algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0026875110&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026875110&partnerID=8YFLogxK

U2 - 10.1145/151333.151377

DO - 10.1145/151333.151377

M3 - Article

VL - 1

SP - 119

EP - 137

JO - ACM letters on programming languages and systems

JF - ACM letters on programming languages and systems

SN - 1057-4514

IS - 2

ER -