Results 1  10
of
48
Bridging the gap between planning and scheduling
 KNOWLEDGE ENGINEERING REVIEW
, 2000
"... Planning research in Artificial Intelligence (AI) has often focused on problems where there are cascading levels of action choice and complex interactions between actions. In contrast, Scheduling research has focused on much larger problems where there is little action choice, but the resulting orde ..."
Abstract

Cited by 115 (12 self)
 Add to MetaCart
(Show Context)
Planning research in Artificial Intelligence (AI) has often focused on problems where there are cascading levels of action choice and complex interactions between actions. In contrast, Scheduling research has focused on much larger problems where there is little action choice, but the resulting ordering problem is hard. In this paper, we give an overview of AI planning and scheduling techniques, focusing on their similarities, differences, and limitations. We also argue that many difficult practical problems lie somewhere between planning and scheduling, and that neither area has the right set of tools for solving these vexing problems.
Domain Filtering Consistencies
 Journal of Artificial Intelligence Research (JAIR)
, 2001
"... Enforcing local consistencies is one of the main features of constraint reasoning. Which level of local consistency should be used when searching for solutions in a constraint network is a basic question. Arc consistency and partial forms of arc consistency have been widely studied, and have been kn ..."
Abstract

Cited by 74 (8 self)
 Add to MetaCart
Enforcing local consistencies is one of the main features of constraint reasoning. Which level of local consistency should be used when searching for solutions in a constraint network is a basic question. Arc consistency and partial forms of arc consistency have been widely studied, and have been known for sometime through the forward checking or the MAC search algorithms. Until recently, stronger forms of local consistency remained limited to those that change the structure of the constraint graph, and thus, could not be used in practice, especially on large networks. This paper focuses on the local consistencies that are stronger than arc consistency, without changing the structure of the network, i.e., only removing inconsistent values from the domains. In the last five years, several such local consistencies have been proposed by us or by others. We make an overview of all of them, and highlight some relations between them. We compare them both theoretically and experimentally, considering their pruning efficiency and the time required to enforce them.
Radio Link Frequency Assignment
 Constraints
, 1999
"... The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference suffered by those whishing to communicate in a given radio communication network. This problem is a combinatorial (NPhard) optimization problem ..."
Abstract

Cited by 70 (11 self)
 Add to MetaCart
(Show Context)
The problem of radio frequency assignment is to provide communication channels from limited spectral resources whilst keeping to a minimum the interference suffered by those whishing to communicate in a given radio communication network. This problem is a combinatorial (NPhard) optimization problem. In 1993, the CELAR (the French "Centre d'Electronique de l'Armement") built a suite of simplified versions of Radio Link Frequency Assignment Problems (RLFAP) starting from data on a real network (Roisnel 93). Initially designed for assessing the performances of several Constraint Logic Programming languages, these benchmarks have been made available to the public in the framework of the European EUCLID project CALMA (Combinatorial Algorithms for Military Applications).
Encodings of NonBinary Constraint Satisfaction Problems
, 1999
"... We perform a detailed theoretical and empirical comparison of the dual and hidden variable encodings of nonbinary constraint satisfaction problems. We identify a simple relationship between the two encodings by showing how we can translate between the two by composing or decomposing relations. ..."
Abstract

Cited by 46 (9 self)
 Add to MetaCart
(Show Context)
We perform a detailed theoretical and empirical comparison of the dual and hidden variable encodings of nonbinary constraint satisfaction problems. We identify a simple relationship between the two encodings by showing how we can translate between the two by composing or decomposing relations. This translation
Understanding and Improving the MAC Algorithm
 In Third International Conference on Principles and Practice of Constraint Programming, LNCS 1330
, 1997
"... . Constraint satisfaction problems have wide application in artificial intelligence. They involve finding values for problem variables where the values must be consistent in that they satisfy restrictions on which combinations of values are allowed. Recent research on finite domain constraint satisf ..."
Abstract

Cited by 44 (2 self)
 Add to MetaCart
(Show Context)
. Constraint satisfaction problems have wide application in artificial intelligence. They involve finding values for problem variables where the values must be consistent in that they satisfy restrictions on which combinations of values are allowed. Recent research on finite domain constraint satisfaction problems suggest that Maintaining Arc Consistency (MAC) is the most efficient general CSP algorithm for solving large and hard problems. In the first part of this paper we explain why maintaining full, as opposed to limited, arc consistency during search can greatly reduce the search effort. Based on this explanation, in the second part of the paper we show how to modify MAC in order to make it even more efficient. Experimental results prove that the gain in efficiency can be quite important. 1 Introduction Constraint satisfaction problems (CSPs) involve finding values for problem variables subject to constraints that are restrictions on which combinations of values are allowed. They...
Propositional Satisfiability and Constraint Programming: a Comparative Survey
 ACM Computing Surveys
, 2006
"... Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two relatively independent threads of research, crossfertilising occasionally. These two approaches to problem solving have a lot in common, as evidenced by similar ideas underlying the branch and prune algorithms ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
Propositional Satisfiability (SAT) and Constraint Programming (CP) have developed as two relatively independent threads of research, crossfertilising occasionally. These two approaches to problem solving have a lot in common, as evidenced by similar ideas underlying the branch and prune algorithms that are most successful at solving both kinds of problems. They also exhibit differences in the way they are used to state and solve problems, since SAT’s approach is in general a blackbox approach, while CP aims at being tunable and programmable. This survey overviews the two areas in a comparative way, emphasising the similarities and differences between the two and the points where we feel that one technology can benefit from ideas or experience acquired
Node and arc consistency in weighted CSP
 in Proceedings of AAAI’02, 2002
"... Recently, a general definition of arc consistency (AC) for soft constraint frameworks has been proposed (Schiex 2000). In this paper we specialize this definition to weighted CSP and introduce a O(ed3) algorithm. Then, we refine the definition and introduce a stronger form of arc consistency (AC*) a ..."
Abstract

Cited by 33 (6 self)
 Add to MetaCart
(Show Context)
Recently, a general definition of arc consistency (AC) for soft constraint frameworks has been proposed (Schiex 2000). In this paper we specialize this definition to weighted CSP and introduce a O(ed3) algorithm. Then, we refine the definition and introduce a stronger form of arc consistency (AC*) along with a O(n2d3) algorithm. We empirically demonstrate that AC * is likely to be much better than AC in terms of pruned values.
ConflictDirected Backjumping Revisited
, 2001
"... In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classified as lookahead schemes and lookback schemes. Unfortunately, lookahead and lookback sche ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classified as lookahead schemes and lookback schemes. Unfortunately, lookahead and lookback schemes are not entirely orthogonal as it has been observed empirically that the enhancement of lookahead techniques is sometimes counterproductive to the effects of lookback techniques. In this paper, we focus on the relationship between the two most important lookahead techniques  using a variable ordering heuristic and maintaining a level of local consistency during the backtracking search  and the lookback technique of conflictdirected backjumping (CBJ). We show that there exists a "perfect" dynamic variable ordering such that CBJ becomes redundant. We also show theoretically that as the level of local consistency that is maintained in the backtracking search is increased, the less that backjumping will be an improvement. Our theoretical results partially explain why a backtracking algorithm doing more in the lookahead phase cannot benefit more from the backjumping lookback scheme. Finally, we show empirically that adding CBJ to a backtracking algorithm that maintains generalized arc consistency (GAC), an algorithm that we refer to as GACCBJ, can still provide orders of magnitude speedups. Our empirical results contrast with Bessiere and Regin's conclusion (1996) that CBJ is useless to an algorithm that maintains arc consistency.
Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems
 CONSTRAINTS
, 2002
"... There are two main solving schemas for constraint satisfaction and optimization problems: i) search, whose basic step is branching over the values of a variables, and ii) dynamic programming, whose basic step is variable elimination. Variable elimination is time and space exponential in a graph para ..."
Abstract

Cited by 24 (6 self)
 Add to MetaCart
(Show Context)
There are two main solving schemas for constraint satisfaction and optimization problems: i) search, whose basic step is branching over the values of a variables, and ii) dynamic programming, whose basic step is variable elimination. Variable elimination is time and space exponential in a graph parameter called induced width, which renders the approach infeasible for many problem classes. However, by restricting variable elimination so that only low arity constraints are processed and recorded, it can be e#ectively combined with search, because the elimination of variables may reduce drastically the search tree size. In this
Robust solutions for constraint satisfaction and optimization
 In Proceedings ECAI’04
, 2004
"... e.hebrard,b.hnich,tw¢ Super solutions are solutions in which, if a small number of variables lose their values, we are guaranteed to be able to repair the solution with only a few changes. In this paper, we stress the need to extend the super solution framework in several dimensions to make it more ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
(Show Context)
e.hebrard,b.hnich,tw¢ Super solutions are solutions in which, if a small number of variables lose their values, we are guaranteed to be able to repair the solution with only a few changes. In this paper, we stress the need to extend the super solution framework in several dimensions to make it more useful practically. We demonstrate the usefulness of those extensions on an example from jobshop scheduling, an optimization problem solved through constraint satisfaction. In such a case there is indeed a tradeoff between optimality and robustness, however robustness may be increased without sacrificing optimality.