Processing disjunctions of temporal constraints

Schwalb, Eddie; Dechter, Rina

doi:10.1109/time.1996.555671

Cited by 5 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The integration of quantitative and qualitative information has been the goal of several temporal models, as was described in Section 1. When intervals are represented by means of their ending points I i + I i -, integration of constraints on intervals and points seems to require some kind of nonbinary constraints between time-points (Gerevini & Schubert, 1995;Schwalb & Dechter, 1997;Drakengren & Jonsson, 1997). In this section, the proposed temporal model is applied in order to integrate interval and point-based constraints.…”

Section: Interval-based Constraints Through Labeled Point-based Constmentioning

confidence: 99%

“…Thus, the total number of disjuncts (subintervals) in a path-consistent TCN might be exponential in the number of disjuncts per constraints in the initial (input) TCN. Schwalb and Dechter (1997) call this the fragmentation problem, which does not appear in non-disjunctive metric TCNs. Thus, the TCA algorithm is O(n 3 R 3 ) in disjunctive metric-TCNs if time is not dense (Dechter et al, 1991), where the range 'R' is the maximum difference between the lowest and highest number specified in any input constraints.…”

Section: Basic Temporal Conceptsmentioning

confidence: 99%

“…However, these labeled derived elemental constraints cannot be simplified. This is related to the fragmentation problem of the disjunctive metric algebra (Schwalb & Dechter, 1997). We have that each derived-labeled elemental constraint should have its own associated label set.…”

Section: Temporal Composition ⊗ Lcmentioning

confidence: 99%

See 2 more Smart Citations

Reasoning on Interval and Point-based Disjunctive Metric Constraints in Temporal Contexts

Barber¹

2000

jair

View full text Add to dashboard Cite

We introduce a temporal model for reasoning on disjunctive metric constraints on intervals and time points in temporal contexts. This temporal model is composed of a labeled temporal algebra and its reasoning algorithms. The labeled temporal algebra defines labeled disjunctive metric pointbased constraints, where each disjunct in each input disjunctive constraint is univocally associated to a label. Reasoning algorithms manage labeled constraints, associated label lists, and sets of mutually inconsistent disjuncts. These algorithms guarantee consistency and obtain a minimal network. Additionally, constraints can be organized in a hierarchy of alternative temporal contexts. Therefore, we can reason on context-dependent disjunctive metric constraints on intervals and points. Moreover, the model is able to represent non-binary constraints, such that logical dependencies on disjuncts in constraints can be handled. The computational cost of reasoning algorithms is exponential in accordance with the underlying problem complexity, although some improvements are proposed.

show abstract

Section: Interval-based Constraints Through Labeled Point-based Constmentioning

confidence: 99%

Section: Basic Temporal Conceptsmentioning

confidence: 99%