A frame architecture for a certain class of graph search problems

DOI10.1109/21.21608MaRDI QIDQ3821640zbMATH OpenOpenAlexFDO

Authors Bon K. Sy, J. R. jun. Deller

Publication date 1988

Published in IEEE Transactions on Systems, Man, and Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/21.21608

zbMATH Keywords

efficient graph searchframe controlframe structured knowledge representation

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Artificial intelligence (68T99)

Recommendations

• Breadth-first heuristic search
• Solution of the problem of the optimal synthesis of information graphs for basic information search problems.
• Dynamic graph-based search in unknown environments
• The hierarchical structure of graph searches
• The complexity of searching a graph

Cited in

(3)

• The hierarchical structure of graph searches
• An adaptive reasoning approach towards effficient ordering of composite hypotheses
• A method of constructing the frame of a directed graph

This page was built for publication: A frame architecture for a certain class of graph search problems

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