Shortest Path by Approximation Programs SUZANNE Arizona W. DIETRICH University State in Logic 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 m approximation algorithms. We present the ETd, ,t ,nC, algorithm, which computes single-source and all-pairs shortest paths over a declarative logic program. The ETd,,, ,nC, 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 ETd,, ~a~C,algorithm in perspective, its execution k compared to those of Dijkstra s single-source and Floyd s all-pairs shortest path algorithms. Categories and Subject Descriptors: D. 1.6 [Programming General Terms: Algorithms Additional Key Words and Phrases: Approximation, dynamic programming, shortest paths Techniques]: Logic
End of preview. The entire article is 19 pages. To view the full-text, please rent this article to continue.
/lp/association-for-computing-machinery/shortest-path-by-approximation-in-logic-programs-Uku2XsNylO
Welcome to DeepDyve! Rent Premier Research Articles and Save Up to 90%
Shortest path by approximation in logic programs
Dietrich, Suzanne W.
Follow ACM Letters on Programming Languages and Systems (LOPLAS)
, Volume 1 (2)
Association for Computing Machinery – Jun 1, 1992
More Info
More Like This Article
View All dataSource[]=actageo&dataSource[]=aspet&dataSource[]=aaos&dataSource[]=aacc&dataSource[]=aacr&dataSource[]=aea&dataSource[]=aip&dataSource[]=ajnr&dataSource[]=ams&dataSource[]=aps_physical&dataSource[]=appi_book&dataSource[]=appi_journal&dataSource[]=apha&dataSource[]=asip&dataSource[]=asm&dataSource[]=asn&dataSource[]=aspb&dataSource[]=avs&dataSource[]=annual_reviews&dataSource[]=arxiv&dataSource[]=acm&dataSource[]=berghahn&dataSource[]=cabi&dataSource[]=clinical_trials&dataSource[]=dailymed&dataSource[]=degruyter&dataSource[]=du_press&dataSource[]=esa&dataSource[]=eu_press&dataSource[]=elsevier&dataSource[]=emerald&dataSource[]=ejtr&dataSource[]=emea&dataSource[]=epo&dataSource[]=faseb&dataSource[]=gsa&dataSource[]=health_affairs&dataSource[]=hindawi&dataSource[]=imanager&dataSource[]=imedpub&dataSource[]=informa_healthcare&dataSource[]=informs&dataSource[]=iop&dataSource[]=iucr&dataSource[]=iospress&dataSource[]=jbjs&dataSource[]=leftcoast&dataSource[]=lu_press&dataSource[]=mesharpe&dataSource[]=mary_ann_liebert&dataSource[]=medline&dataSource[]=mit_press&dataSource[]=nature&dataSource[]=oxford&dataSource[]=pier_professional&dataSource[]=pnas&dataSource[]=portlandpress&dataSource[]=psyc_articles&dataSource[]=psyc_books&dataSource[]=psyc_critiques&dataSource[]=plos_journal&dataSource[]=pubmed_central&dataSource[]=rsna&dataSource[]=rockefeller&dataSource[]=rcn&dataSource[]=ria&dataSource[]=rsc&dataSource[]=sage&dataSource[]=spie&dataSource[]=springer_journal&dataSource[]=springer&dataSource[]=taylor_francis&dataSource[]=aps&dataSource[]=the_scientist&dataSource[]=uc_press&dataSource[]=uspto_abstract&dataSource[]=wiley&dataSource[]=pct
© 2012 DeepDyve, Inc. All rights reserved.
Terms of Service | Privacy Policy
