Soft Constraint Logic Programming and Generalized Shortest Path Problems

@article{Bistarelli2002SoftCL,
  title={Soft Constraint Logic Programming and Generalized Shortest Path Problems},
  author={Stefano Bistarelli and Ugo Montanari and Francesca Rossi},
  journal={J. Heuristics},
  year={2002},
  volume={8},
  pages={25-41}
}
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… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-8 of 8 references

“ Power Domains

  • M. B. Smyth
  • Journal of Computer and System Sciences
  • 1978
Highly Influential
3 Excerpts

Semiring-based Constraint Solving and Optimization.

  • San Matco, U. Montanari, F. Rossi
  • Journal of the ACM
  • 1997

Jaffar, J

  • LNCS
  • and J.L. Lassez. (1987). “Constraint Logic…
  • 1520

Similar Papers

Loading similar papers…