Semirings for Soft Constraint Solving and Programming

• Κύριος συγγραφέας: Bistarelli, Stefano (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2004.
• Σειρά: Lecture Notes in Computer Science, 2962
• Θέματα: Mathematics.; Computer programming.; Software engineering.; Programming languages (Electronic computers).; Computer logic.; Artificial intelligence.; Algebra.; Programming Languages, Compilers, Interpreters.; Programming Techniques.; Software Engineering.; Logics and Meanings of Programs.; Artificial Intelligence (incl. Robotics).

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...

Πίνακας περιεχομένων:

• 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.