By Topic

Pruning search trees by cylindrical closure

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Lee, J.H.M. ; Dept. of Comput. Sci., Chinese Univ. of Hong Kong, Hong Kong ; Van Emden, M.H.

Abstract interpretation can be applied to speed up constrained combinatorial search. The approximations used are supersets of the constraints. The authors study an instance of this method by selecting as the supersets the cylindrical closures of Ashby (1964). The result is the method of pruning by cylindrical closure (PCC). When the closures are of order 1 and the constraints are binary, the arc consistency method of Mackworth (1977) is obtained. In the nonbinary case one gets the lookahead inference of CHIP. PCC with closure of order higher than 1 yields new consistency methods

Published in:

Communications, Computers and Signal Processing, 1993., IEEE Pacific Rim Conference on  (Volume:2 )

Date of Conference:

19-21 May 1993