A case study in the meta-reasoning procedure ND
A new technique for improving the efficiency of propositional reasoning procedures is presented. The meta-search procedure, ND, is parameterized by a search procedure P and a real number for controlling the way in which P is applied to the given problem. Experiments using SATO on the domain of Crossword Puzzle Construction (CPC) illustrate the potential for ND. Variations of and future experiments with ND are discussed.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
Document Type: Research Article
Affiliations: 1: Department of Statistics, University of Toronto, 100 St. George Street, Toronto, Ontario, Canada M5S 3G3 2: Cornell University, Ithaca, NY 14853-2801, USA
Publication date: January 1, 2003