Skip to main content
padlock icon - secure page this page is secure

A case study in the meta-reasoning procedure ND

Buy Article:

$61.00 + tax (Refund Policy)

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
No Metrics

Keywords: knowledge representation; problem solving; search; threshold phenomena

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

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more