Augmenting Disjunctive Temporal Problems with Finite-Domain Constraints
Abstract
We present a general framework for augmenting instances of the Disjunctive Temporal Problem (DTP) with finite-domain constraints. In this new formalism, the bounds of the temporal constraints become conditional on the finite-domain assignment. This hybridization makes it possible to reason simultaneously about temporal relationships between events as well as their nontemporal properties. We provide a special case of this hybridization that allows reasoning about a limited form of spatial constraints; namely, the travel time induced by the locations of a set of activities. We develop a least-commitment algorithm for efficiently finding solutions to this combined constraint system and provide empirical results demonstrating the effectiveness of our approach.
Cite
Text
Moffitt et al. "Augmenting Disjunctive Temporal Problems with Finite-Domain Constraints." AAAI Conference on Artificial Intelligence, 2005.Markdown
[Moffitt et al. "Augmenting Disjunctive Temporal Problems with Finite-Domain Constraints." AAAI Conference on Artificial Intelligence, 2005.](https://mlanthology.org/aaai/2005/moffitt2005aaai-augmenting/)BibTeX
@inproceedings{moffitt2005aaai-augmenting,
title = {{Augmenting Disjunctive Temporal Problems with Finite-Domain Constraints}},
author = {Moffitt, Michael D. and Peintner, Bart and Pollack, Martha E.},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2005},
pages = {1187-1192},
url = {https://mlanthology.org/aaai/2005/moffitt2005aaai-augmenting/}
}