#### Filter Results:

- Full text PDF available (131)

#### Publication Year

1977

2017

- This year (2)
- Last 5 years (6)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Eugene C. Freuder
- IJCAI
- 1989

A constraint satisfaction problem involves finding values for variables subject to constraints on which combinations of values are allowed. In some cases it may be impossible or impractical to solve these problems completely. We may seek to partially solve the problem in an "optimal" or "sufficient" sense. A formal model is presented for defining and… (More)

- Eugene C. Freuder
- J. ACM
- 1982

A constraint satisfaction problem revolves finding values for a set of variables subject to a set of constraints (relations) on those variables Backtrack search is often used to solve such problems. A relationship involving the structure of the constraints is described which characterizes to some degree the extreme case of mimmum backtracking (none) The… (More)

- Daniel Sabin, Eugene C. Freuder
- ECAI
- 1994

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. Two standard techniques used in solving such problems are backtrack search and consistency inference.… (More)

- Eugene C. Freuder
- Commun. ACM
- 1978

A constraint network representation is presented for a combinatorial search problem: finding values for a set of variables subject to a set of constraints. A theory of consistency levels in such networks is formulated, which is related to problems of backtrack tree search efficiency. An algorithm is developed that can achieve any level of consistency… (More)

- Eugene C. Freuder
- AAAI
- 1991

- Alan K. Mackworth, Eugene C. Freuder
- Artif. Intell.
- 1985

- Eugene C. Freuder
- J. ACM
- 1985

Backtrack search is often used to solve constraint satisfaction problems. A relationship involving the structure of the constraints is described that provides a bound on the backtracking required to advance deeper into the backtrack tree. This analysis leads to upper bounds on the effort required for solution of a class of constraint satisfaction problems.… (More)

- Eugene C. Freuder, Charles D. Elfe
- AAAI/IAAI, Vol. 1
- 1996

Constraint satisfaction consistency preprocessing methods are used to reduce search e ort Time and especially space costs limit the amount of preprocess ing that will be cost e ective A new form of con sistency preprocessing neighborhood inverse consis tency can achieve more problem pruning than the usual arc consistency preprocessing in a cost e ective… (More)

- Christian Bessiere, Pedro Meseguer, Eugene C. Freuder, Javier Larrosa
- Artif. Intell.
- 1999

Solving non-binary constraint satisfaction problems, a crucial challenge today, can be tackled in two different ways: translating the non-binary problem into an equivalent binary one, or extending binary search algorithms to solve directly the original problem. The latter option raises some issues when we want to extend definitions written for the binary… (More)

- Eugene C. Freuder, Michael J. Quinn
- IJCAI
- 1985

Binary constraint sat is fact ion problems involve f ind ing values for variables subject to constraints between pairs of variables. A lgo r i t hms that take advantage of the st ructure of constra int connections can be more efficient than simple backtrack search. Some pairs of variables may have no direct constraint between them, even if they are l inked… (More)