Journal of Heuristics

, Volume 8, Issue 1, pp 25–41 | Cite as

Soft Constraint Logic Programming and Generalized Shortest Path Problems

  • Stefano Bistarelli
  • Ugo Montanari
  • Francesca Rossi
Article

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 problems soft constraints constraint logic programming 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bistarelli, S., U. Montanari, and F. Rossi. (1995). “Constraint Solving over Semirings.” In proc. IJCAI95. San Matco, CA: Morgan Kaufman.Google Scholar
  2. Bistarelli, S., U. Montanari, and F. Rossi. (1997a). “Semiring-based Constraint Logic Programming.” In proc. IJCAI97. San Matco, CA: Morgan Kaufman.Google Scholar
  3. Bistarelli, S., U. Montanari, and F. Rossi. (1997b). “Semiring-based Constraint Solving and Optimization.” Journal of the ACM 44(2), 201–236.Google Scholar
  4. Dreyfus, S.E. (1969). “An Appraisal of Some Shortest-Paths Algorithms.” Operation Research 17, 395–412.Google Scholar
  5. Floyd, R.W. (1962). Algorithm 97: Shortest Path: Communication of ACM 5, 345.Google Scholar
  6. Georget, Y. and P. Codognet. (1998). “Compiling Semiring-Based Constraints with clp (fd,s).” In CP98, Springer. LNCS 1520.Google Scholar
  7. Jaffar, J. and J. L. Lassez. (1987). “Constraint Logic Programming.” In Proc. POPL. New York: ACM.Google Scholar
  8. Leiserson, C.E., T.H. Cormen, and R.L. Rivest. (1990). Introduction to Algorithms, ch. 26. Cambridge, MA: MIT Press.Google Scholar
  9. Lloyd, J.W. (1987). Foundations of Logic Programming. Berlin: Springer Verlag.Google Scholar
  10. Pallottino, S. and M.G. Scutellà. (1988). “Shortest Path Algorithms in Transportation Models: Classical and Innovative Aspects. In P. Marcotte and S. Nguyen (eds.), Equilibrium and Advanced Transportation Modelling. pp. 245–281.Google Scholar
  11. Smyth, M.B. (1978). “Power Domains.” Journal of Computer and System Sciences 16(1), 23–36.Google Scholar

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

Personalised recommendations