Learn More
This paper presents an evaluation of two orthogonal schemes for improving the efficiency of solving constraint satisfaction problems (CSPs). The first scheme involves a class of pre-processing techniques designed to make the representation of the CSP more explicit, including directional-arcconsistency, directional-path-consistency and adaptive-consistency.(More)
This paper examines the possibility of removing redundant information from a given knowledge base and restructuring it in the form of a tree to enable e cient problemsolving routines. We o er a novel approach that guarantees removal of all redundancies that hide a tree structure. We develop a polynomial-time algorithm that, given an arbitrary binary(More)
  • 1