Soft Constraint Logic Programming and Generalized Shortest Path Problems

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)...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of heuristics Ročník 8; číslo 1; s. 25 - 41
Hlavní autoři: Bistarelli, Stefano, Montanari, Ugo, Rossi, Francesca
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer Nature B.V 01.01.2002
Témata:
Algorithms
Heuristic
Logic programming
Optimization
Semantics
Studies
ISSN:1381-1231, 1572-9397
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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. [PUBLICATION ABSTRACT]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1381-1231
1572-9397
DOI:10.1023/A:1013609600697