Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Introduction to algorithms
Semiring-based constraint satisfaction and optimization
Journal of the ACM (JACM)
Communications of the ACM
Semiring-based constraint logic programming
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Constraint solving over semirings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Semiring-based constraint logic programming: syntax and semantics
ACM Transactions on Programming Languages and Systems (TOPLAS)
Quantitative μ-calculus and CTL defined over constraint semirings
Theoretical Computer Science - Quantitative aspects of programming languages (QAPL 2004)
Theoretical Computer Science
Semiring-Based Soft Constraints
Concurrency, Graphs and Models
A Soft Approach to Multi-objective Optimization
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Cost-algebraic heuristic search
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Quantitative μ-calculus and CTL Based on Constraint Semirings
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Unicast and multicast QoS routing with soft-constraint logic programming
ACM Transactions on Computational Logic (TOCL)
Preferences in AI: An overview
Artificial Intelligence
Route finder: efficiently finding k shortest paths using constraint programming
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Event-Driven probabilistic constraint programming
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
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.