Recent Advances in Constraints 11th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2006 Caparica, Portugal, June 26-28, 2006 Revised Selected and Invited Papers / [electronic resource] :
edited by Francisco Azevedo, Pedro Barahona, Francois Fages, Francesca Rossi.
- 1st ed. 2007.
- VIII, 188 p. online resource.
- Lecture Notes in Artificial Intelligence, 4651 2945-9141 ; .
- Lecture Notes in Artificial Intelligence, 4651 .
Tutorial -- Hybrid Algorithms in Constraint Programming -- Technical Papers -- An Attempt to Dynamically Break Symmetries in the Social Golfers Problem -- A Constraint Model for State Transitions in Disjunctive Resources -- Reusing CSP Propagators for QCSPs -- Bipolar Preference Problems: Framework, Properties and Solving Techniques -- Distributed Forward Checking May Lie for Privacy -- Solving First-Order Constraints in the Theory of the Evaluated Trees -- Extracting Microstructure in Binary Constraint Networks -- Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees -- Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems -- Cost-Based Filtering for Stochastic Inventory Control.
9783540738176
10.1007/978-3-540-73817-6 doi
Artificial intelligence.
Compilers (Computer programs).
Computer science.
Algorithms.
Numerical analysis.
Machine theory.
Artificial Intelligence.
Compilers and Interpreters.
Computer Science Logic and Foundations of Programming.
Algorithms.
Numerical Analysis.
Formal Languages and Automata Theory.
Q334-342 TA347.A78
006.3
Tutorial -- Hybrid Algorithms in Constraint Programming -- Technical Papers -- An Attempt to Dynamically Break Symmetries in the Social Golfers Problem -- A Constraint Model for State Transitions in Disjunctive Resources -- Reusing CSP Propagators for QCSPs -- Bipolar Preference Problems: Framework, Properties and Solving Techniques -- Distributed Forward Checking May Lie for Privacy -- Solving First-Order Constraints in the Theory of the Evaluated Trees -- Extracting Microstructure in Binary Constraint Networks -- Complexity of a CHR Solver for Existentially Quantified Conjunctions of Equations over Trees -- Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems -- Cost-Based Filtering for Stochastic Inventory Control.
9783540738176
10.1007/978-3-540-73817-6 doi
Artificial intelligence.
Compilers (Computer programs).
Computer science.
Algorithms.
Numerical analysis.
Machine theory.
Artificial Intelligence.
Compilers and Interpreters.
Computer Science Logic and Foundations of Programming.
Algorithms.
Numerical Analysis.
Formal Languages and Automata Theory.
Q334-342 TA347.A78
006.3