Semirings for soft constraint solving and programming
Constraint satisfaction and constraint programming have shown to be very simple but powerful ideas, with applications in various areas. Still, in the last ten years, the simple notion of constraints has shown some deficiencies concerning both theory and practice, typically in the way over-constraine...
Guardat en:
| Autor principal: | |
|---|---|
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
2962 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Semirings for soft constraint solving and programming, Stefano Bistarelli, Berlin, Springer, 2004, 1 vol. (XII-279 p.), Lecture notes in computer science, 3-540-21181-0 • Semirings for Soft Constraint Solving and Programming, Texte imprimé, 9783662205198 |
Taula de continguts:
- 1. Introduction
- 2. Soft Constraint Satisfaction Problems
- 3. Towards SCSPs Solutions
- 4. SCSP Abstraction
- 5. Higher Order Semiring-Based Constraints
- 6. Soft CLP
- 7. SCLP and Generalized Shortest Path Problems
- 8. Soft Concurrent Constraint Programming
- 9. Interchangeability in Soft CSPs
- 10. SCSPs for Modelling Attacks to Security Protocols
- 11. Conclusions and Directions for Future Work.