Problem representations and formal properties of heuristic search
From MaRDI portal
Publication:1238643
DOI10.1016/0020-0255(76)90009-8zbMath0359.68110OpenAlexW2056445637MaRDI QIDQ1238643
Publication date: 1976
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0255(76)90009-8
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Probabilistic analysis of the complexity of A* ⋮ Knowledge versus search: a quantitative analysis using A* ⋮ A result on the computational complexity of heuristic estimates for the \(A^*\) algorithm
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The \(Q^*\) algorithm - a search strategy for a deductive question-answering system
- Heuristic search viewed as path finding in a graph
- An admissible and optimal algorithm for searching AND/OR graphs
- State-space problem-reduction, and theorem proving—some relationships
- Some Binary Derivation Systems
- Heuristic search
- The Unit Proof and the Input Proof in Theorem Proving
- Experiments in automatic learning for a multipurpose hueristic program
- Experiments With Some Programs That Search Game Trees
- The Specialization of Programs by Theorem Proving
This page was built for publication: Problem representations and formal properties of heuristic search
