An analysis of consecutively bounded depth-first search with applications in automated deduction

Authors:
Mark E. Stickel;W. Mabry Tyson
Affiliations:
Artificial Intelligence Center, SRI International, Menlo Park, California;Artificial Intelligence Center, SRI International, Menlo Park, California
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 2
Cited 6

Depth-first iterative-deepening: an optimal admissible tree search

Artificial Intelligence
Principles of artificial intelligence

Principles of artificial intelligence

Building Theorem Provers

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
A parallel implementation of iterative-deepening-A

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
A parallel implementation of iterative-deepening-A

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
Incremental, approximate planning

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Depth-first vs best-first search

AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
Artificial intelligence search algorithms

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a type inference method for Prolog programs. The new idea is to describe a superset of the success set by associating a type substitution (an assignment of sets of ground terms to variables) with each head of definite clause. ...