the proceedings contain 9 papers. the topics discussed include: from marriages to coalitions: a soft CSP approach;solving CSPs with naming games;an efficient decision procedure for functional decomposable theories bas...
ISBN:
(纸本)3642032508
the proceedings contain 9 papers. the topics discussed include: from marriages to coalitions: a soft CSP approach;solving CSPs with naming games;an efficient decision procedure for functional decomposable theories based on dual constraints;challenges in constraint-based analysis of hybrid systems;from rules to constraint programs withthe rules2CP modeling language;combining symmetry breaking and global constraints;iterative flattening search on RCPSP/max problems: recent developments;robust solutions in unstable optimization problem;and IDB-ADOPT: a depth-first search DCOP algorithm.
the proceedings contain 9 papers. the special focus in this conference is on constraintsolving and constraintlogicprogramming. the topics include: Procedural code generation vs static expansion in modelling languag...
ISBN:
(纸本)9783642194856
the proceedings contain 9 papers. the special focus in this conference is on constraintsolving and constraintlogicprogramming. the topics include: Procedural code generation vs static expansion in modelling languages for constraintprogramming;solvingthe static design routing and wavelength assignment problem;a resource cost aware cumulative;integrating strong local consistencies into constraint solvers;dynamic constraint satisfaction problems: Relations among search strategies, solution sets and algorithm performance;constraint-based modeling and scheduling of clinical pathways;MAC-DBT revisited.
the proceedings contain 9 papers. the topics discussed include: solving weighted argumentation frameworks with soft constraints;connecting BnB-ADOPT with soft arc consistency: initial results;procedural code generatio...
ISBN:
(纸本)9783642194856
the proceedings contain 9 papers. the topics discussed include: solving weighted argumentation frameworks with soft constraints;connecting BnB-ADOPT with soft arc consistency: initial results;procedural code generation vs static expansion in modelling languages for constraintprogramming;solvingthe static design routing and wavelength assignment problem;a resource cost aware cumulative;integrating strong local consistencies into constraint solvers;dynamic constraint satisfaction problems: relations among search strategies, solution sets and algorithm performance;constraint-based modeling and scheduling of clinical pathways;and MAC-DBT revisited.
the proceedings contain 11 papers. the topics discussed include: hybrid algorithms in constrained programming;an attempt to dynamically break symmetries in the social golfers problem;a constraint model for state trans...
详细信息
ISBN:
(纸本)9783540738169
the proceedings contain 11 papers. the topics discussed include: hybrid algorithms in constrained programming;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 quantifies conjunctions of equations over trees;efficient recognition of acrylic clustered constraint satisfaction problems;and cost-based filtering for stochastic inventory control.
the proceedings contain 10 papers. the topics discussed include: a comparison of the notions of optimality in soft constraints and graphical games;temporal reasoning in nested temporal networks with alternatives;SCLP ...
ISBN:
(纸本)3540898115
the proceedings contain 10 papers. the topics discussed include: a comparison of the notions of optimality in soft constraints and graphical games;temporal reasoning in nested temporal networks with alternatives;SCLP for trust propagation in small-world networks;improving ABT performance by adding synchronization points;on the integration of singleton consistencies and look-ahead heuristics;combining two structured domains for modeling various graph matching problems;quasi-linear-time algorithms by generalization of union-find in CHR;preference-based problem solving for constraintprogramming;generalizing global constraints based on network flows;and a global filtration for satisfying goals in mutual exclusion net.
constraintsolving problems (CSPs) represent a formalization of an important class of problems, in computer science. We propose here a solving methodology based oil the naming games. the naming game was introduced to ...
详细信息
ISBN:
(纸本)9783642032509
constraintsolving problems (CSPs) represent a formalization of an important class of problems, in computer science. We propose here a solving methodology based oil the naming games. the naming game was introduced to represent N agents that have to bootstrap an agreement on a name to give to an object. the agents do not have a hierarchy and use a minimal protocol. Still they converge to a consistent state by using a distributed strategy. For this reason the naming game can be used to untangle distributed constraintsolving problems (DCSPs). Moreover it represents a good starting point for a systematic study of DCSP methods, which can be seen as further improvement of this approach.
Combinatorial problems such as scheduling, resource allocation, and configuration may involve many attributes that can be subject of user preferences. Traditional optimization approaches compile those preferences into...
详细信息
ISBN:
(纸本)9783540898115
Combinatorial problems such as scheduling, resource allocation, and configuration may involve many attributes that can be subject of user preferences. Traditional optimization approaches compile those preferences into a single utility function and use it as the optimization objective when solvingthe problem, but neither explain why the resulting solution satisfies the original preferences, nor indicate the trade-offs made during problem solving. We argue that the whole problem solving process becomes more transparent and controllable for the user if it is based on the original preferences. We will use the original preferences to control this process and to produce explanations of optimality of the resulting solution. Based on this explanation, the user can refine the preference model, thus gaining full control over the problem solver.
We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common Global constraints. We give a general purpose propagator for this family of co...
详细信息
ISBN:
(纸本)9783642032509
We propose a new family of constraints which combine together lexicographical ordering constraints for symmetry breaking with other common Global constraints. We give a general purpose propagator for this family of constraints. and show how to improve its complexity by exploiting properties of the included global constraints.
this book constitutes the proceedings of the Kiel Declarative programming Days, KDPD 2013, unifying the following conferences: the 20thinternational Conference on Applications of Declarative programming and Knowledge...
ISBN:
(数字)9783319089096
ISBN:
(纸本)9783319089089
this book constitutes the proceedings of the Kiel Declarative programming Days, KDPD 2013, unifying the following conferences: the 20thinternational Conference on Applications of Declarative programming and Knowledge Management (INAP 2013), the 22nd internationalworkshop on Functional and (constraint) logicprogramming (WFLP 2013) and the 27thworkshop on logicprogramming (WLP 2013), held in Kiel, Germany, in September 2013. the 15 papers presented were carefully and reviewed and selected for inclusion in this book. they cover the following topics: logicprogramming, constraint problem solving, programmable logic solvers, functional programming and constraintprogramming.
this paper surveys hybrid algorithms from a constraintprogramming perspective. It introduces techniques used within a constructive search framework, such as propagation and linear relaxation, as well as techniques us...
详细信息
ISBN:
(纸本)9783540738169
this paper surveys hybrid algorithms from a constraintprogramming perspective. It introduces techniques used within a constructive search framework, such as propagation and linear relaxation, as well as techniques used in combination with search by repair.
暂无评论