Constraint Handling Rules Current Research Topics /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Schrijvers, Tom (Επιμελητής έκδοσης), Frühwirth, Thom (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2008.
• Σειρά: Lecture Notes in Computer Science, 5388
• Θέματα: Computer science.; Computer programming.; Algorithms.; Mathematical logic.; Database management.; Artificial intelligence.; Computer Science.; Artificial Intelligence (incl. Robotics).; Programming Techniques.; Mathematical Logic and Formal Languages.; Algorithm Analysis and Problem Complexity.; Database Management.

The Constraint Handling Rules (CHR) language is a declarative concurrent committed-choice constraint logic programming language consisting of guarded rules that transform multisets of relations called constraints until no more change occurs. The CHR language saw the light more than 15 years ago. Sin...

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

• Welcome to Constraint Handling Rules
• A Flexible Search Framework for CHR
• Adaptive CHR Meets CHR???
• Constructing Rule-Based Solvers for Intentionally-Defined Constraints
• Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules
• A Compositional Semantics for CHR with Propagation Rules
• CHR for Imperative Host Languages
• Guard Reasoning in the Refined Operational Semantics of CHR.