Journal of Heuristics

, Volume 8, Issue 1, pp 25–41

Soft Constraint Logic Programming and Generalized Shortest Path Problems

  • Stefano Bistarelli
  • Ugo Montanari
  • Francesca Rossi
Article

DOI: 10.1023/A:1013609600697

Cite this article as:
Bistarelli, S., Montanari, U. & Rossi, F. Journal of Heuristics (2002) 8: 25. doi:10.1023/A:1013609600697

Abstract

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 problemssoft constraintsconstraint logic programming

Copyright information

© Kluwer Academic Publishers 2002

Authors and Affiliations

  • Stefano Bistarelli
    • 1
  • Ugo Montanari
    • 1
  • Francesca Rossi
    • 2
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly
  2. 2.Dipartimento di Matematica Pura ed ApplicataUniversità di PadovaPadovaItaly