Results 1  10
of
864
ArcConsistency and ArcConsistency Again
 Artificial Intelligence
, 1994
"... Constraint networks are known as a useful way to formulate problems such as design, scene labeling, temporal reasoning, and more recently natural language parsing. The problem of the existence of solutions in a constraint network is NPcomplete. Hence, consistency techniques have been widely studied ..."
Abstract

Cited by 152 (12 self)
 Add to MetaCart
studied to simplify constraint networks before or during the search of solutions. Arcconsistency is the most used of them. Mohr and Henderson [Moh&Hen86] have proposed AC4, an algorithm having an optimal worstcase time complexity. But it has two drawbacks: its space complexity and its average time
Analysis of Distributed ArcConsistency Algorithms
, 1997
"... Consistency techniques can significantly reduce the search space of constraint satisfaction problems (CSP). In particular, arcconsistency algorithms, such as AC3 [7], AC4 [8] and AC6 [2], have been designed. In [9], we presented DisAC4, a coarsegrained parallel algorithm designed for distribut ..."
Abstract

Cited by 50 (0 self)
 Add to MetaCart
Consistency techniques can significantly reduce the search space of constraint satisfaction problems (CSP). In particular, arcconsistency algorithms, such as AC3 [7], AC4 [8] and AC6 [2], have been designed. In [9], we presented DisAC4, a coarsegrained parallel algorithm designed
A filtering algorithm for constraints of difference in CSPs
 Proceedings of AAAI’94, the 12th (US) National Conference on Artificial Intelligence
, 1994
"... Abstract Many reallife Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These constraints are called constraints of difference. They are defined on a subset of variables by a set of tuples for which the values occuring in the same tuple are ..."
Abstract

Cited by 378 (6 self)
 Add to MetaCart
are all different. In this paper, a new filtering algorithm for these constraints is presented. It achieves the generalized arcconsistency condition for these nonbinary constraints. It is based on matching theory and its complexity is low. In fact, for a constraint defined on a subset of p variables
Improving ArcConsistency Algorithms with DoubleSupport Checks
 In Proceedings of the Eleventh Irish Conference on Artificial Intelligence and Cognitive Science
, 2000
"... Arcconsistency algorithms are widely used to simplify Constraint Satisfaction Problems. The new notion of a doublesupport check is presented to improve the average performance of arcconsistency algorithms. The improvement is that, where possible, consistencychecks are used to nd supports for t ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
to improve AC3 and DEE and results in a new general purpose arcconsistency algorithm called AC3 b . Experimental results of a comparison of AC3, DEE, AC3 b and AC7 are presented. The results seem to indicate that AC3 b always performs better than DEE and usually performs better than both AC3
A Comparative Study of ArcConsistency Algorithms
, 2001
"... Arc consistency plays an important role in Constraint Satisfaction Problems (CSPs). Several algorithms have been made to deal with arc consistency. AC3, AC4, AC7 are very famous algorithms in this area. Our work is tried to figure out, which one is better to use. We judge it not only by constrain ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Arc consistency plays an important role in Constraint Satisfaction Problems (CSPs). Several algorithms have been made to deal with arc consistency. AC3, AC4, AC7 are very famous algorithms in this area. Our work is tried to figure out, which one is better to use. We judge it not only
An ArcConsistency Algorithm for the
 Proceedings of the Eighth International Conference on Principles and Practice of Constraint Programming (CP 2002), volume 2470 of LNCS
, 2002
"... Historically, discrete minimization problems in constrained logical programming were modeled with the help of an isolated bounding constraint on the objective that is to be decreased. To overcome this frequently inefficient way of searching for improving solutions, the notion of optimization cons ..."
Abstract
 Add to MetaCart
constraints was introduced. Optimization constraints can be viewed as global constraints that link the objective with other constraints of the problem at hand. We present an arcconsistency (actually: hyperarcconsistency) algorithm for the minimum weight all different constraint which is an optimization
Lightweight ArcConsistency Algorithms
, 2003
"... Arcconsistency algorithms are the workhorse of many backtrack algorithms. Most research on arcconsistency algorithms is focusing on the design of algorithms that are optimal when it comes to worst case scenarios. This report will provide experimental evidence that, despite common belief to the con ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
worst case timecomplexity, but which has a better spacecomplexity than AC2001. Both algorithms will be compared for MAC search and for stand alone arcconsistency (the task of making a single CSP arcconsistent). For stand alone arcconsistency AC3 d is the better algorithm when it comes to time
Using Bidirectionality to Speed Up ArcConsistency Processing
"... In [Bes94a, BC93], Bessi`ere and Cordier said that the AC6 arcconsistency algorithm is optimal in time on constraint networks where nothing is known about the constraint semantics. However, in constraint networks, it is always assumed that constraints are bidirectional. None of the previous al ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
algorithms achieving arcconsistency (AC3 [Mac77, MF85], AC4 [MH86], AC6) use constraint bidirectionality. We propose here an improved version of AC6 which uses this property. Then, we claim that our new algorithm is optimal in the number of constraint checks performed (i.e. given a variable, value
Parallelisation of ArcConsistency Algorithms
 IN JORNADAS CHILENAS DE COMPUTACIÓN, 2002. VI WORKSHOP ON DISTRIBUTED SYSTEMS AND PARALLELISM, COPIAPÓCHILE
, 2002
"... This work presents the parallelisation of the AC5 arcconsistency algorithm for two dierent parallel architectures. One is a cluster of PCs and the other is a centralised memory machine (CMM). We conducted our experiments using an adapted version of the PCSOS parallel constraint solving system, ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
This work presents the parallelisation of the AC5 arcconsistency algorithm for two dierent parallel architectures. One is a cluster of PCs and the other is a centralised memory machine (CMM). We conducted our experiments using an adapted version of the PCSOS parallel constraint solving system
A Fast Algorithm to Establish ArcConsistency in Constraint Networks
, 1994
"... In [1], Bessière and Cordier said that the AC6 arcconsistency algorithm is optimal in time on constraint networks where nothing is known about the constraint semantics. However, in constraint networks, it is always assumed that constraints are symmetric. None of the previous algorithms achieving a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
arcconsistency (AC3, AC4, AC6) use this property. We propose here an improved version of AC6 (the best known algorithm for arcconsistency), which uses this property. 1. Introduction In the last five years, the number of applications using constraint networks has dramatically increased
Results 1  10
of
864