Source-tracking unification

Choppella, Venkatesh; Haynes, Christopher T.

doi:10.1016/j.ic.2004.10.013

Cited by 4 publications

(1 citation statement)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The application of such to automated theorem proving, logic programming, and artificial intelligence is evident; indeed, it is the basis of logic programming. Choppella and Haynes [6] investigated the problem of deriving the shortest unification path for a given problem, and determine that it is simply a special case of the context-free language constrained shortest path problem. In addition to citing the algorithm given by Barrett,et al [4] to solve this problem, they also provide an algorithm that produces non-optimal solutions but runs faster than the O(|V | 3 |N ||P |) given by the best Barrett et al algorithm.…”

Section: Language Constrained Shortest Pathsmentioning

confidence: 99%

A Distributed Context-Free Language Constrained Shortest Path Algorithm

Ward

Wiegand

Bradford

2008

2008 37th International Conference on Parallel Processing

View full text Add to dashboard Cite

Formal language constrained shortest path problems are concerned with finding shortest paths in labeled graphs. These labeled paths have the constraint that the concatenation of labels along a path constitute a valid string in some formal language Λ over alphabet Σ. These problems are well studied where the formal language is regular or context-free, and have been used in a variety of applications ranging from databases, to transportation planning, to programming languages. Barrett, Jacob, and Marathe's best algorithm for the context-free language constrained path problem runs in O(|V | 3 |N ||P |) time, where N is the set of non-terminals for the input grammar and P is the set of productions (expressed in Chomsky Normal Form). We present a work and time efficient distributed version of this algorithm that may be distributed on up to O(|V ||N |) nodes.

show abstract

Section: Language Constrained Shortest Pathsmentioning

confidence: 99%