×

On the complexity of admissible search algorithms. (English) Zbl 0344.68023


MSC:

68T15 Theorem proving (deduction, resolution, etc.) (MSC2010)
68W99 Algorithms in computer science
68Q25 Analysis of algorithms and problem complexity
Full Text: DOI

References:

[1] Harris, L. R., The heuristic search under conditions of error, Artificial Intelligence, 5, 217-234 (Fall 1974) · Zbl 0288.68050
[2] Hart, P.; Nilsson, N.; Raphael, B., A formal basis for the heuristic determination of minimum cost paths, IEEE Trans. Systems, Man and Cybernet, 4, 100-107 (July 1968)
[3] Hart, P.; Nilsson, N.; Raphael, B., Correction to “A formal basis for the heuristic determination of minimum cost paths”, SIGART Newsletter, 28-29 (December 1972)
[4] Johnson, D. B., A note on Dijkstra’s shortest path algorithm, J. ACM, 20, 385-388 (July 1973) · Zbl 0265.68026
[5] Lawler, E.; Wood, D., Branch-and-bound methods: A survey, Operations Research, 14, 699-719 (July-August 1966) · Zbl 0143.42501
[6] Martelli, A.; Montanari, U., An application of heuristically guided search to elimination processes, (Proc. International Computing Symposium. Proc. International Computing Symposium, Venice (April 1972)), 59-72
[7] Martelli, A.; Montanari, U., From dynamic programming to search algorithms with functional costs, (N.I.B-75/1 (1975), IEI: IEI Pisa) · Zbl 0289.49024
[8] Martelli, A.; Montanari, U., From dynamic programming to search algorithms with functional costs, (Proc. Fourth International Joint Conference on Artificial Intelligence. Proc. Fourth International Joint Conference on Artificial Intelligence, Tbilisi (1975)), 345-350
[9] Michie, D.; Ross, R., Experiments with the adaptive graph traverser, (Meltzer, B.; Michie, D., Machine Intelligence, 5 (1969), Edinburgh Univ. Press: Edinburgh Univ. Press Edinburgh), 301-318 · Zbl 0221.68059
[10] Nilsson, N. J., Problem-solving Methods in Artificial Intelligence (1971), McGraw-Hill: McGraw-Hill New York
[11] Nilsson, N. J., Artificial Intelligence, (Proc. IFIP Congress, 74 (1974), North-Holland: North-Holland Amsterdam), 778-801 · Zbl 0303.68053
[12] Pohl, I., First results on the effect of error in heuristic search, (Meltzer, B.; Michie, D., Machine Intelligence, 5 (1969), Edinburgh Univ. Press: Edinburgh Univ. Press Edinburgh), 219-236 · Zbl 0221.68058
[13] Pohl, I., Heuristic search viewed as path finding in a graph, Artificial Intelligence, 1, 193-204 (Fall 1970) · Zbl 0206.22603
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.