Problem representations and formal properties of heuristic search

DOI10.1016/0020-0255(76)90009-8zbMATH Open0359.68110OpenAlexW2056445637MaRDI QIDQ1238643FDOQ1238643

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

• Heuristic search viewed as path finding in a graph
• The Specialization of Programs by Theorem Proving
• Title not available (Why is that?)
• Title not available (Why is that?)
• Experiments With Some Programs That Search Game Trees
• Title not available (Why is that?)
• The Unit Proof and the Input Proof in Theorem Proving
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An admissible and optimal algorithm for searching AND/OR graphs
• Title not available (Why is that?)
• Some Binary Derivation Systems
• The \(Q^*\) algorithm - a search strategy for a deductive question-answering system
• State-space problem-reduction, and theorem proving—some relationships
• Experiments in automatic learning for a multipurpose hueristic program
• Heuristic search

Cited In (3)

• Knowledge versus search: a quantitative analysis using A*
• Probabilistic analysis of the complexity of 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)