Soft constraint logic programming and generalized shortest path problems
From MaRDI portal
Publication:5960030
DOI10.1023/A:1013609600697zbMath1073.90563MaRDI QIDQ5960030
Stefano Bistarelli, Ugo Montanari, Francesca Rossi
Publication date: 11 April 2002
Published in: Journal of Heuristics (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)
Related Items (8)
Finding reliable solutions: event-driven probabilistic constraint programming ⋮ C-semiring Frameworks for Minimum Spanning Tree Problems ⋮ Semiring-Based Soft Constraints ⋮ The optimal dispatch of Traffic and Patrol Police Service Platforms ⋮ Weighted monadic Datalog ⋮ A Soft Approach to Multi-objective Optimization ⋮ Quantitative \(\mu\)-calculus and CTL defined over constraint semirings ⋮ Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
This page was built for publication: Soft constraint logic programming and generalized shortest path problems
