Journal of Heuristics

, Volume 8, Issue 1, pp 25-41

First online:

Soft Constraint Logic Programming and Generalized Shortest Path Problems

  • Stefano BistarelliAffiliated withDipartimento di Informatica, Università di Pisa
  • , Ugo MontanariAffiliated withDipartimento di Informatica, Università di Pisa
  • , Francesca RossiAffiliated withDipartimento di Matematica Pura ed Applicata, Università di Padova

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.

shortest path problems soft constraints constraint logic programming