A pattern-weight formulation of search knowledge

Computational Intelligence

Volumn 17, Issue 4, 2001, Pages 783-811

  Levinson, R ^a   Fuchs, G ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Heuristic search; Knowledege representation; Macro feature construction; Pattern retrieval; Reactive planning; Subgoals; Tile puzzles

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; INFORMATION RETRIEVAL; PATTERN MATCHING; PROBLEM SOLVING;

PATTERN RETRIEVAL;

KNOWLEDGE REPRESENTATION;

EID: 0035510529     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/0824-7935.00172     Document Type: Article

References (54)

1. An empirical analysis of optimization techniques for terminological representation systems
2. Developments with G
3. The B* tree search algorithm: A best first proof procedure
4. A unified theory of heuristic evaluation functions and its application to learning
5. Searching with pattern databases
6. Managing complex objects in PIERCE
7. The CG Mars Lander
8. Experience-based adaptive search
9. An automatically compilable network recognition network for structured patterns
10. Man and machine: Chess achievements and chess thinking
11. Notes on the '15' puzzle
12. A theoretical analysis of conjunctive-goal planning
13. A theory of abstraction for hierarchical planning
14. Learning to solve problems by searching for Macro-Operators
15. Planning as search: A quantitative approach
16. Optimal path finding algorithms
17. Solving the twenty-four puzzle
18. SOAR: An architecture for general intelligence
19. A pattern classification approach to evaluation function learning
20. A self-organizing retrieval system for graphs
21. Intelligent signal analysis and recognition using a self-organizing database
22. A self-learning, pattern-oriented, chess program
23. UDS: A universal data structure
24. Pattern associativity and the retrieval of semantic networks
25. Adaptive pattern-oriented chess
26. A self-organizing pattern retrieval system
27. General game-playing and reinforcement learning
28. Bi-directional search
29. Joint and LPA: Combination of approximation and search
30. Finding a shortest solution for the N×N extension of the 15-puzzle is intractable
31. Complete solutions of the eight-puzzle and the benefit of node ordering in IDA*
32. Complete solution of the eight-puzzle
33. A self-organized knowledge base for recall, design, and discovery in organic chemistry