Strategies for Global
Optimization of Temporal Preferences
|
|||||
Abstract A temporal reasoning problem
can often be naturally characterized
as a collection of constraints with associated local
preferences for times that make up the admissible values for
those constraints. Globally preferred solutions to such problems
emerge as a result of well-defined operations that compose
and order temporal assignments. The overall objective
of this work is a characterization of different notions of global
preference, and to identify tractable sub-classes of temporal
reasoning problems incorporating these notions. This paper
extends previous results by refining the class of useful notions
of global temporal preference that are associated with problems
that admit of tractable solution techniques. This paper
also answers the hitherto open question of whether problems
that seek solutions that are globally preferred from a utilitarian
criterion for global preference can be found tractably.
|
|||||
pdf file ![]() |