Results 1  10
of
26
Reasoning About Temporal Relations: The Tractable Subalgebras Of Allen's Interval Algebra
 Journal of the ACM
, 2001
"... Allen's interval algebra is one of the best established formalisms for temporal reasoning. This paper is the final step in the classification of complexity in Allen's algebra. We show that the current knowledge about tractability in the interval algebra is complete, that is, this algebra c ..."
Abstract

Cited by 42 (2 self)
 Add to MetaCart
(Show Context)
Allen's interval algebra is one of the best established formalisms for temporal reasoning. This paper is the final step in the classification of complexity in Allen's algebra. We show that the current knowledge about tractability in the interval algebra is complete, that is, this algebra contains exactly eighteen maximal tractable subalgebras, and reasoning in any fragment not entirely contained in one of these subalgebras is NPcomplete. We obtain this result by giving a new uniform description of the known maximal tractable subalgebras and then systematically using an algebraic technique for identifying maximal subalgebras with a given property.
A Unifying Approach to Temporal Constraint Reasoning
 Artificial Intelligence
"... We present a formalism, Disjunctive Linear Relations (DLRs), for reasoning about temporal constraints. DLRs subsume most of the formalisms for temporal constraint reasoning proposed in the literature and is therefore computationally expensive. We also present a restricted type of DLRs, Horn DLRs ..."
Abstract

Cited by 36 (11 self)
 Add to MetaCart
(Show Context)
We present a formalism, Disjunctive Linear Relations (DLRs), for reasoning about temporal constraints. DLRs subsume most of the formalisms for temporal constraint reasoning proposed in the literature and is therefore computationally expensive. We also present a restricted type of DLRs, Horn DLRs, which have a polynomialtime satisfiability problem. We prove that most approaches to tractable temporal constraint reasoning can be encoded as Horn DLRs, including the ORDHorn algebra by Nebel and Burckert and the simple temporal constraints by Dechter et al. Thus, DLRs is a suitable unifying formalism for reasoning about temporal constraints. 1 Introduction Reasoning about temporal knowledge abounds in artificial intelligence applications and other areas, such as planning [4], natural language understanding [25] and molecular biology [6, 13]. In most applications, knowledge of temporal constraints is expressed in terms of collections of relations between time intervals or time po...
Temporal Representation and Reasoning in Artificial Intelligence: Issues and Approaches
, 2002
"... this paper, we survey a wide range of research in temporal representation and reasoning, without committing ourselves to the point of view of any speci c application ..."
Abstract

Cited by 27 (1 self)
 Add to MetaCart
this paper, we survey a wide range of research in temporal representation and reasoning, without committing ourselves to the point of view of any speci c application
Twentyone Large Tractable Subclasses of Allen's Algebra
 ARTIFICIAL INTELLIGENCE
, 1997
"... This paper continues Nebel and Burckert's investigation of Allen's interval algebra by presenting nine more maximal tractable subclasses of the algebra (provided that P != NP), in addition to their previously reported ORDHorn subclass. Furthermore, twelve tractable subclasses are identifi ..."
Abstract

Cited by 23 (8 self)
 Add to MetaCart
This paper continues Nebel and Burckert's investigation of Allen's interval algebra by presenting nine more maximal tractable subclasses of the algebra (provided that P != NP), in addition to their previously reported ORDHorn subclass. Furthermore, twelve tractable subclasses are identified, whose maximality is not decided. Four of them can express the notion of sequentiality between intervals, which is not possible in the ORDHorn algebra. All of the algebras are considerably larger than the ORDHorn subclass. The satisfiability algorithm, which is common for all the algebras, is shown to be linear. Furthermore, the path consistency algorithm is shown to decide satisfiability of interval networks using any of the algebras.
Reasoning on Interval and Pointbased Disjunctive Metric Constraints in Temporal Contexts
 Journal of Artificial Intelligence Research
, 2000
"... 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 defineslabeled disjunctive metric pointbased co ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
(Show Context)
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 defineslabeled 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 contextdependent disjunctive metric constraints on intervals and points. Moreover, the model is able to represent nonbinary constraints, such that logical dependencies on disjuncts in constraints can be handled. The computational cost of reasoning algorithms is exponential in ac...
Reasoning about Action in Polynomial Time
, 1997
"... Although many formalisms for reasoning about action exist, surprisingly few approaches have taken computational complexity into consideration. The contributions of this paper are the following: a temporal logic with a restriction for which deciding satisfiability is tractable, a tractable extension ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
Although many formalisms for reasoning about action exist, surprisingly few approaches have taken computational complexity into consideration. The contributions of this paper are the following: a temporal logic with a restriction for which deciding satisfiability is tractable, a tractable extension for reasoning about action, and NPcompleteness results for the unrestricted problems. Many interesting reasoning problems can be modelled, involving nondeterminism, concurrency and memory of actions. The reasoning process is proved to be sound and complete. 145 1 Introduction Although many formalisms for reasoning about action exist, surprisingly few approaches have taken computational complexity into consideration. One explanation for this might be that many interesting AI problems are (at least) NPhard, and that tractable subproblems that are easily extracted, tend to lack expressiveness. This has led a large part of the AI community to rely on heuristics and incomplete systems to s...
A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations
 Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI '97
, 1998
"... We characterise the set of subalgebras of Allen's algebra which have a tractable satisfiability problem, and in addition contain certain basic relations. The conclusion is that no tractable subalgebra that is not known in the literature can contain more than the three basic relations (j), (b) a ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
We characterise the set of subalgebras of Allen's algebra which have a tractable satisfiability problem, and in addition contain certain basic relations. The conclusion is that no tractable subalgebra that is not known in the literature can contain more than the three basic relations (j), (b) and (b ), where b 2 fd; o; s; fg. This means that concerning algebras for specifying complete knowledge about temporal information, there is no hope of finding yet unknown classes with much expressivity. We also classify completely some cases where we cannot even express complete information (but close to complete), showing that there are exactly two maximal tractable algebras containing the relation (OE ), exactly two containing the relation (OE m m ), and exactly three containing the relation (OE m). The algebras containing (OE ) can express the notion of sequentiality; thus we have a complete characterisation of tractable inference using that notion. 1 Introduction This paper improves o...
An aprioribased approach for firstorder temporal pattern mining
"... Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting sequential patterns whose specification needs a more expressive formalism, the firstorder temporal logic. In this paper, we fo ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Previous studies on mining sequential patterns have focused on temporal patterns specified by some form of propositional temporal logic. However, there are some interesting sequential patterns whose specification needs a more expressive formalism, the firstorder temporal logic. In this paper, we focus on the problem of mining multisequential patterns which are firstorder temporal patterns (not expressible in propositional temporal logic). We propose two Aprioribased algorithms to perform this mining task. The first one, the PM (Projection Miner) Algorithm adapts the key idea of the classical GSP algorithm for propositional sequential pattern mining by projecting the firstorder pattern in two propositional components during the candidate generation and pruning phases. The second algorithm, the SM (Simultaneous Miner) Algorithm, executes the candidate generation and pruning phases without decomposing the pattern, that is, the mining process, in some extent, does not reduce itself to its propositional counterpart. Our extensive experiments shows that SM scales up far better than PM.
Some Observations on Durations, Scheduling and Allen's Algebra
 In Proceedings of the 6th Conference on Constraint Programming (CP'00
, 2000
"... . We continue the study of complexity issues in Allen's algebra extended for handling metric durations. The eighteen known maximal tractable subclasses are studied and we show that three of them can be extended with metric constraints on the durations without sacrificing tractability, while the ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
(Show Context)
. We continue the study of complexity issues in Allen's algebra extended for handling metric durations. The eighteen known maximal tractable subclasses are studied and we show that three of them can be extended with metric constraints on the durations without sacrificing tractability, while the remaining fifteen subclasses become NPcomplete even if we restrict ourselves to the case of fixed lengths on the durations. We also consider the scheduling problem and the main result is that ORDHorn is the only known maximal subclass for which the scheduling problem is tractable. This extends previous tractability results on scheduling in Allen's algebra since we allow far more temporal relations and we allow intervals with uncertain durations. 1 Introduction Representing and reasoning about time has for a long time been acknowledged as one of the core areas of artificial intelligence and a large number of formalisms for temporal constraint reasoning (TCR) have been proposed in the literatur...
Planning temporal events using point–interval logic
, 2006
"... The paper presents a temporal logic and its application to planning timecritical missions. An extended version of the Point–Interval Logic (PIL) is presented that incorporates both point and interval descriptions of time. The points and intervals in this formalism represent time stamps and time del ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
The paper presents a temporal logic and its application to planning timecritical missions. An extended version of the Point–Interval Logic (PIL) is presented that incorporates both point and interval descriptions of time. The points and intervals in this formalism represent time stamps and time delays, respectively, associated with events/activities in a mission as constraints on or as resultants of a planning process. The lexicon of the logic offers the flexibility of qualitative and/or quantitative descriptions of temporal relationships between points and intervals of a system. The provision for qualitative temporal relationships makes the approach suitable for situations where all the required quantitative information may not be available to planners. A graphbased approach, called the Point Graph (PG) methodology, is shown to implement the axiomatic system of PIL by transforming the temporal specifications into Point Graphs. A temporal inference engine uses the Point Graph representation to infer and verify the feasibility of temporal relations among system intervals/points. The paper demonstrates the application of PIL and its inference engine to a missionplanning problem.