Deadlines, travel time, and robot problem solving

Authors:
David Miller;R. James Firby;Thomas Dean
Affiliations:
Yale University, Department of Computer Science, New Haven, Connecticut;Yale University, Department of Computer Science, New Haven, Connecticut;Yale University, Department of Computer Science, New Haven, Connecticut
Venue:
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 2
Year:
1985

Citing 1
Cited 2

Maintaining knowledge about temporal intervals

Communications of the ACM

The consistent labeling problem in temporal reasoning

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1
The consistent labeling problem in temporal reasoning

AAAI'87 Proceedings of the sixth National conference on Artificial intelligence - Volume 1

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. ...