Open AccessOn the Discovery and Generation of Certain Heuristics
Author(s) -
Pearl Judea
Publication year - 1983
Publication title -
ai magazine
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.597
H-Index - 79
eISSN - 2371-9621
pISSN - 0738-4602
ISBN - 0-929280-01-6
DOI - 10.1609/aimag.v4i1.385
Subject(s) - heuristics , heuristic , computer science , process (computing) , domain (mathematical analysis) , scheme (mathematics) , theoretical computer science , mathematical optimization , artificial intelligence , mathematics , programming language , mathematical analysis , operating system
This paper explores the paradigm that heuristics are discovered by consulting simplified models of the problem domain After describing the features of typical heuristics on some popular problems, we demonstrate that these heuristics can be obtained by the process of deleting constraints from the original problem and solving the relaxed problem which ensues We then outline a scheme for generating such heuristics mechanically, which involves systematic refinement and deletion of constraints from the original problem specification until a semi‐decomposable model is identified The solution to the latter consitutes a heuristic for the former