Name
Abstract | ||
|---|---|---|
Several methods for temporal reasoning with metric time have been suggested--for instance, Horn Disjunctive Linear Relations (Horn DLRs). However, it has been noted that implementing this algorithm is non-trivial since it builds on fairly complicated polynomial-time algorithms for linear Perogramming. Instead, an alternative approach which augments Allen's interval algebra with a Simple Temporal Problem (STP) has been suggested (Condotta, 2000). In this paper, we present a new point-based approach STP* for reasoning about metric temporal constraints. STP* subsumes the tractable preconvex fragment of the augmented interval algebra and can be viewed as a slightly restricted version of Horn DLRs. We give an easily implementable algorithm for deciding satisfiability of STP* and demonstrate experimentally its efficiency. We also give a method for finding solutions to consistent STP* problem instances. |
Year | Venue | Keywords |
|---|---|---|
2002 | AAAI/IAAI | horn dlrs,metric time,implementable algorithm,consistent stp,metric temporal reasoning,horn disjunctive linear relations,alternative approach,augmented interval algebra,interval algebra,complicated polynomial-time algorithm,metric temporal constraint,satisfiability,bayesian networks,linear program |
Field | DocType | ISBN |
Interval algebra,Computer science,Metric time,Satisfiability,Algorithm,Bayesian network,Artificial intelligence,Machine learning | Conference | 0-262-51129-0 |
Citations | PageRank | References |
1 | 0.37 | 13 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mathias Broxvall | 1 | 301 | 25.54 |