The complexity of searching implicit graphs

Artificial Intelligence 86 (1):171-188 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0004-3702(96)00014-8

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,757

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

An efficient algorithm for searching implicit AND/OR graphs with cycles.P. Jiménez & C. Torras - 2000 - Artificial Intelligence 124 (1):1-30.
An admissible and optimal algorithm for searching AND/OR graphs.C. L. Chang & J. R. Slagle - 1971 - Artificial Intelligence 2 (2):117-128.
Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search.P. P. Chakrabarti - 1994 - Artificial Intelligence 65 (2):329-345.
Optimal query complexity bounds for finding graphs.Sung-Soon Choi & Jeong Han Kim - 2010 - Artificial Intelligence 174 (9-10):551-569.
The computational complexity of multi-agent pathfinding on directed graphs.Bernhard Nebel - 2024 - Artificial Intelligence 328 (C):104063.
Graphs of models.Sanjaya Addanki, Roberto Cremonini & J. Scott Penberthy - 1991 - Artificial Intelligence 51 (1-3):145-177.
Generalized and/or graphs.Giorgio Levi & Franco Sirovich - 1976 - Artificial Intelligence 7 (3):243-259.
Refutation graphs.Robert E. Shostak - 1976 - Artificial Intelligence 7 (1):51-64.
Coherence graphs.Enrique Miranda & Marco Zaffalon - 2009 - Artificial Intelligence 173 (1):104-144.
Resolution graphs.Robert A. Yates, Bertram Raphael & Timothy P. Hart - 1970 - Artificial Intelligence 1 (3-4):257-289.

Analytics

Added to PP
2020-12-22

Downloads
15 (#1,243,005)

6 months
10 (#427,773)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Add more references