In [Walsh and Stergiou, 1999] enforcing arc consistency (AC) in the dual encoding was shown to strictly dominate enforcing AC on the hidden or GAC on the original problem. We introduce a dual encoding that requires on...
详细信息
We present an extension to indexicals to describe propagators for global constraints. the resulting language is compiled into actual propagators for different solvers, and is solver-independent. In addition, we show h...
详细信息
this paper describes a global constraint on a fixed-length sequence of finite-domain variables requiring that the corresponding sequence of values taken by these variables belong to a given regular language, thereby g...
详细信息
Tractable classes of binary CSP and binary Max-CSP have recently been discovered by studying classes of instances defined by excluding subproblems. In this paper we characterise the complexity of all classes of binary...
详细信息
A backdoor in a finite-domain CSP instance is a set of variables where each possible instantiation moves the instance into a polynomial-time solvable class. Backdoors have found many applications in artificial intelli...
详细信息
For solving a distributed CSP by a distributed constraint satisfaction algorithm, since agents usually have intra-agent constraints (constraints which are defined over variables of one agent) and inter-agent constrain...
ISBN:
(纸本)3540410538
For solving a distributed CSP by a distributed constraint satisfaction algorithm, since agents usually have intra-agent constraints (constraints which are defined over variables of one agent) and inter-agent constraints (constraints which are defined over variables of multiple agents), they have not only to perform local computation to satisfy their intra- and inter-agent constraints, but also to communicate with other agents to satisfy their inter-agent constraints. the efficiency of a distributed constraint satisfaction algorithm depends on its communication cost and computation cost, and both can vary withthe numbers of intra- and inter-agents constraints. therefore, it is important to know how the numbers of intra- and inter-agent constraints affect the communication and computation costs of a distributed constraint satisfaction algorithm because such an information may give us a hint to develop a more efficient distributed constraint satisfaction algorithm.
GSAT has been proven highly effective for solving certain classes of large SAT problems. It starts from a randomly generated truth assignment and tries to reduce the number of violated clauses by iteratively flipping ...
详细信息
constraintprogramming (CP) is a very general programming paradigm that proved its efficiency on solving complex industrial problems. Most real-life problems are stochastic in nature, which is usually taken into accou...
详细信息
Our goal is to investigate the definition and application of strong consistency properties on the dual graphs of binary constraint Satisfaction Problems (CSPs). As a first step in that direction, we study the structur...
详细信息
Machine systems for understanding hand-drawn sketches must reliably interpret common but sloppy curvilinear configurations. the task is commonly expressed as finding an image model in the image data, but few approache...
详细信息
暂无评论