Problem representations and formal properties of heuristic search
type: Item
instance of: scholarly article
title: Problem representations and formal properties of heuristic search
zbMATH Open document ID: 0359.68110
DOI: 10.1016/0020-0255(76)90009-8
published in: Information Sciences
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68W99
zbMATH DE Number: 3560797
author: Gordon J. VanderBrug
MaRDI profile type: Publication
full work available at URL: 0020-0255(76)90009-8
OpenAlex ID: W2056445637
cites work: Q5578546
cites work: Q5590427
cites work: Experiments in automatic learning for a multipurpose hueristic program
cites work: Q4401546
cites work: Heuristic search
cites work: Q5626300
cites work: Q5623241
cites work: Q5626306
cites work: Heuristic search viewed as path finding in a graph
cites work: Q5507983
cites work: Q5585003
cites work: Experiments With Some Programs That Search Game Trees
cites work: An admissible and optimal algorithm for searching AND/OR graphs
cites work: The Specialization of Programs by Theorem Proving
cites work: Q5626307
cites work: The \(Q^*\) algorithm - a search strategy for a deductive question-answering system
cites work: The Unit Proof and the Input Proof in Theorem Proving
cites work: Q5679703
cites work: Q5672218
cites work: State-space problem-reduction, and theorem proving—some relationships
cites work: Some Binary Derivation Systems
description: scientific article; zbMATH DE number 3560797