Generalizing Temporal Controllability
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 1985-1989.
Abstract
In this paper, we focus on extending the expressive power of constraint-based temporal reasoning formalisms. We begin with the well-known Simple Temporal Problem with Uncertainty, and incorporate three extensions: prior observability, in which the values of uncontrollable events become known prior to their actual occurrence; partial shrinkage, in which an observation event triggers the reduction of a contingent temporal interval; and a generalization of partial shrinkage to requirement links, making it possible to express certain types of uncertainty that may arise even when the time points in a problem are themselves fully controllable. We describe levels of controllability in the resulting formalism, the Generalized STPU, and relate this formalism to related developments in disjunctive temporal reasoning. Throughout, we motivate our approach with simple, real-world examples that illustrate the limitations of existing formalisms and the flexibility of our proposed extensions.
@inproceedings{ijcai2007p320,
title = {Generalizing Temporal Controllability},
author = {Moffitt, Michael D. and Pollack, Martha E.},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {1985--1989},
year = {2007},
url = {https://ijcai.org/proceedings/2007/320},
}
TY - CPAPER TI - Generalizing Temporal Controllability AU - Moffitt, Michael D. AU - Pollack, Martha E. T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 1985 EP - 1989 UR - https://ijcai.org/proceedings/2007/320 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: