Interchangeability preprocessing can improve forward checking search. Authors ... Interchangeability preprocessing can improve forward checking search.
Interchangeability preprocessing can improve forward checking search. 1992 · Brent W. Benson, Eugene C. Freuder · European Conference on Artificial ...
Third, for the case of constraints of mutual exclusion, we show that locally interchangeable values can be computed in a straight- forward manner, and that the ...
CSPs are usually solved by interleaving backtrack search with some form of constraint propagation, for example forward checking or arc consistency. Constraint ...
In the following, three forward-checking search pro- cedures are compared. ... Interchangeability preprocessing can improve forward checking search. In ...
[PDF] On the Computation of Local Interchangeability in Discrete ...
citeseerx.ist.psu.edu › document
Abstract. In [6], Freuder de nes several types of interchange- ability to capture the equivalence among the values of a variable in a discrete constraint ...
Benson, B.W., Freuder, E.: Interchangeability preprocessing can improve forward checking search. · Bistarelli, S., Faltings, B., Neagu, N.: A definition of ...
Another use of interchangeability is to reduce search complexity by group- ... Interchangeability preprocess- ing can improve forward checking search. In ...
Interchangeability Preprocessing Can Improve. Forward Checking Search In Proceedings ECAI'92, pages 28-30, 1992. 3. T. Castell and H. Fargier. Propositional ...
Substitutability and interchangeability in CSPs have been introduced by. Freuder ([12]) in 1991 with the intention of improving search efficiency for solving.