Although constraintprogramming offers a wealth of strong, general-purpose methods, in practice a complex, real application demands a person who selects, combines, and refines various available techniques for constrai...
详细信息
In the scope of distributed constraint reasoning, the main algorithms presented so far have a feature in common: the addition of links between previously unrelated agents, before or during search. Our work presents a ...
详细信息
In this paper we have modeled tradeoffs in constraint-based configuration as additional constraints, and begun to study the issues involved in generating and evaluating such tradeoffs. We describe our basic approach i...
详细信息
the constraint propagation process is a powerful tool for solving constraint satisfaction problems (CSPs). We propose a filtering technique which exploits at best this tool in order to improve the pruning efficiency. ...
详细信息
Nowadays, constraint processing has become a mayor issue in engineering applications based on digital product models. A modern product naturally decomposes into numerous subcomponents, the physical behaviour of which ...
详细信息
A constraint satisfaction problem is defined by a set of variables associated to domains,and a set of constraints on these variables. Solving a constraint satisfaction problem consists in finding assignments of all va...
ISBN:
(纸本)3540428631
A constraint satisfaction problem is defined by a set of variables associated to domains,and a set of constraints on these variables. Solving a constraint satisfaction problem consists in finding assignments of all variables that satisfy all constraints. Since this problem is NP-hard,constraint propagation has been designed to struggle against the combinatorial explosion of brute-force search by pruning domains before enumeration. Filtering algorithms enforcing consistency properties [8]are the most well-known techniques for constraint propagation.
the paper presents propagation rules that are common to the minimum constraint family and to the number of distinct values constraint family. One practical interest of the paper is to describe an implementation of the...
详细信息
In recent years, many constraint-specific filtering algorithms have been introduced. Such algorithms use the semantics of the constraint to perform filtering more efficiently than a generic algorithm. the usefulness o...
详细信息
Configuration tasks are an important application area in engineering design. the proposed solving techniques use either a constraint based framework or a logic-based approach. We propose a methodology to obtains desir...
详细信息
the Stable Marriage problem (SM) is an extensively-studied combinatorial problem with many practical applications. In this paper we present two encodings of an instance I of SM as an instance J of a constraint Satisfa...
详细信息
暂无评论