MEIRI, I. 1992. Temporal reasoning: A constraint-based approach. PhD dissertation, UCLA. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Merging Plans with Quantitative Temporal Constraints.. - Tsamardinos, Pollack.. (2000) (1 citation) (Correct)
....threats. We employ Yang s approach as the second of a three phase process for merging more expressive plans. In the first phase, we identify conflicts between the plans that are to be merged, using a new data structure, conditional simple temporal networks (CSTNs) CSTNs are an extension of STNs (Meiri 1992). In the second phase, we use Yang s method to suggest a potential resolution to the identified conflicts. Finally, the CSTN is again used to check whether the proposed resolution observes all the temporal constraints. We have implemented the algorithm and conducted experiments to evaluate it, and ....
....number. Temporal reasoning problems that are restricted to constraints of this form can be represented with Simple Temporal Networks (STNs) and it has been shown that they can be solved in polynomial time, as opposed to more general temporal constraint satisfaction problems which are NP complete (Meiri 1992). The crucial difference between STNs and general TCPs is that STNs do not allow disjunctive constraints. With the language of STNs, we can still represent the standard ordering constraints of traditional planning systems ( s i precedes s j ) We can also represent a wide range of other ....
[Article contains additional citation context not shown here]
Meiri, I. 1992. Temporal Reasoning: A ConstraintBased Approach. Ph.D. Dissertation, UCLA.
Merging Plans with Quantitative Temporal Constraints.. - Tsamardinos, Pollack.. (2000) (1 citation) (Correct)
....the threats. We employYang s approach as the second of a three phase process for merging more expressive plans. In the #rst phase, we identify con#icts between the plans that are to be merged, using a new data structure, conditional simple temporal networks #CSTNs#; CSTNs are an extension of STNs #Meiri 1992#. In the second phase, we use Yang s method to suggest a potential resolution to the identi #ed con#icts. Finally, the CSTN is again used to check whether the proposed resolution observes all the temporal constraints. Wehave implemented the algorithm and conducted experiments to evaluate it, and ....
....number. Temporal reasoning problems that are restricted to constraints of this form can be represented with Simple Temporal Networks #STNs#, and it has been shown that they can be solved in polynomial time, as opposed to more general temporal constraint satisfaction problems which are NP complete #Meiri 1992#. The crucial di#erence between STNs and general TCPs is that STNs do not allow disjunctive constraints. With the language of STNs, we can still represent the standard ordering constraints of traditional planning systems ##s i precedes s j #. We can also represent a wide range of other ....
[Article contains additional citation context not shown here]
Meiri, I. 1992. Temporal Reasoning: A ConstraintBased Approach. Ph.D. Dissertation, UCLA.
On Binary Constraint Problems - Ladkin, Maddux (1994) (62 citations) (Correct)
....the underlying domain of values is infinite, and each constraint is an infinite relation. Allen adapted a constraint propagation algorithm to an infinite domain to help in the analysis of such problems. See [2] 6] 13] 20] 22] 24] 25] 26] 27] 28] 29] 30] 31] 32] 45] [46], 50] 55] 62] 63] 64] and [66] We formulate CSP concepts and methods using relation algebras. We believe this clarifies the mathematics of binary constraint satisfaction methods, and allows problems with finite or potentially infinite domains to be handled in a uniform way. For example, ....
Meiri, I., Temporal Reasoning: A Constraint-Based Approach, Ph.D. Thesis, Technical Report R-173, Cognitive Systems Laboratory, UCLA, 1992.
A Framework for Resolution of Time in Natural - Language Benjamin Han (2004) (Correct)
No context found.
MEIRI, I. 1992. Temporal reasoning: A constraint-based approach. PhD dissertation, UCLA.
A Time Calculus for Natural Language - Benjamin Han Michael (2003) (Correct)
No context found.
Meiri, I., \Temporal Reasoning: A Constraint-based Approach," Ph.D. thesis, UCLA (1992).
A Time Calculus for Natural Language - Han, Kohlhase (2003) (Correct)
No context found.
Meiri, I., \Temporal Reasoning: A Constraint-based Approach," Ph.D. thesis, UCLA (1992).
On Binary Constraint Problems - Peter Ladkin Institut (1994) (62 citations) (Correct)
No context found.
Meiri, I., Temporal Reasoning: A Constraint-Based Approach, Ph.D. Thesis, Technical Report R-173, Cognitive Systems Laboratory, UCLA, 1992.
A General Framework for Reasoning About Change - Augusto (2002) (Correct)
No context found.
) Meiri I., Temporal Reasoning: A Constraint-Based Approach, Ph.D. Thesis, University of California,
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC