In this paper we study the relationship between Constraint Programming (CP) and Shortest Path (SP) problems. In particular, we show that classical, multicriteria, partially ordered, and modality-based SP problems can be naturally modeled and solved within the Soft Constraint Logic Programming (SCLP) framework, where logic programming is coupled with soft constraints. In this way we provide this large class of SP problems with a high-level and declarative linguistic support whose semantics takes care of both finding the cost of the shortest path(s) and also of actually finding the path(s). On the other hand, some efficient algorithms for certain classes of SP problems can be exploited to provide some classes of SCLP programs with an efficient way to compute their semantics.
|Autori interni:||MONTANARI, UGO GIOVANNI ERASMO|
|Autori:||Bistarelli S; Montanari U; Rossi F|
|Titolo:||Soft constraint logic programming and generalized shortest path problems|
|Anno del prodotto:||2002|
|Digital Object Identifier (DOI):||10.1023/A:1013609600697|
|Appare nelle tipologie:||1.1 Articolo in rivista|