Problem representations and formal properties of heuristic search

DOI10.1016/0020-0255(76)90009-8MaRDI QIDQ1238643zbMATH OpenOpenAlexFDO

Authors Gordon J. VanderBrug

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

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3435053 (Why is no real title available?)
• scientific article; zbMATH DE number 3219315 (Why is no real title available?)
• scientific article; zbMATH DE number 3298341 (Why is no real title available?)
• scientific article; zbMATH DE number 3303642 (Why is no real title available?)
• scientific article; zbMATH DE number 3309664 (Why is no real title available?)
• scientific article; zbMATH DE number 3347627 (Why is no real title available?)
• scientific article; zbMATH DE number 3351214 (Why is no real title available?)
• scientific article; zbMATH DE number 3351222 (Why is no real title available?)
• scientific article; zbMATH DE number 3351223 (Why is no real title available?)
• scientific article; zbMATH DE number 3407200 (Why is no real title available?)
• scientific article; zbMATH DE number 3415384 (Why is no real title available?)
• An admissible and optimal algorithm for searching AND/OR graphs
• Experiments With Some Programs That Search Game Trees
• Experiments in automatic learning for a multipurpose hueristic program
• Heuristic search
• Heuristic search viewed as path finding in a graph
• Some Binary Derivation Systems
• State-space problem-reduction, and theorem proving—some relationships
• The Specialization of Programs by Theorem Proving
• The Unit Proof and the Input Proof in Theorem Proving
• The \(Q^*\) algorithm - a search strategy for a deductive question-answering system

Cited in

(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

This page was built for publication: Problem representations and formal properties of heuristic search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1238643)