Results 1  10
of
43
Reasoning about Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra
 Journal of the ACM
, 1995
"... We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method is sufficient ..."
Abstract

Cited by 195 (8 self)
 Add to MetaCart
We introduce a new subclass of Allen's interval algebra we call "ORDHorn subclass," which is a strict superset of the "pointisable subclass." We prove that reasoning in the ORDHorn subclass is a polynomialtime problem and show that the pathconsistency method
Reasoning about Qualitative Temporal Information
 Artificial Intelligence
, 1992
"... Representing and reasoning about incomplete and indefinite qualitative temporal information is an essential part of many artificial intelligence tasks. An intervalbased framework and a pointbased framework have been proposed for representing such temporal information. In this paper, we address ..."
Abstract

Cited by 149 (6 self)
 Add to MetaCart
Representing and reasoning about incomplete and indefinite qualitative temporal information is an essential part of many artificial intelligence tasks. An intervalbased framework and a pointbased framework have been proposed for representing such temporal information. In this paper, we
Tractable Disjunctions of Linear Constraints: Basic Results and Applications to Temporal Reasoning
 Theoretical Computer Science
, 1996
"... We study the problems of deciding consistency and performing variable elimination for disjunctions of linear inequalities and disequations with at most one inequality per disjunction. This new class of constraints extends the class of generalized linear constraints originally studied by Lassez an ..."
Abstract

Cited by 52 (3 self)
 Add to MetaCart
and McAloon. We show that deciding consistency of a set of constraints in this class can be done in polynomial time. We also present a variable elimination algorithm which is similar to Fourier's algorithm for linear inequalities. Finally, we use these results to provide new temporal reasoning
Efficient methods for qualitative spatial reasoning
 Proceedings of the 13th European Conference on Artificial Intelligence
, 1998
"... The theoretical properties of qualitative spatial reasoning in the RCC8 framework have been analyzed extensively. However, no empirical investigation has been made yet. Our experiments show that the adaption of the algorithms used for qualitative temporal reasoning can solve large RCC8 instances, ..."
Abstract

Cited by 52 (12 self)
 Add to MetaCart
The theoretical properties of qualitative spatial reasoning in the RCC8 framework have been analyzed extensively. However, no empirical investigation has been made yet. Our experiments show that the adaption of the algorithms used for qualitative temporal reasoning can solve large RCC8 instances
Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis
 In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI99
, 1999
"... We present a general method for proving tractability of reasoning over disjunctions of jointly exhaustive and pairwise disjoint relations. Examples of these kinds of relations are Allen's temporal interval relations and their spatial counterpart, the RCC8 relations by Randell, Cui, and Cohn. Ap ..."
Abstract

Cited by 47 (15 self)
 Add to MetaCart
We present a general method for proving tractability of reasoning over disjunctions of jointly exhaustive and pairwise disjoint relations. Examples of these kinds of relations are Allen's temporal interval relations and their spatial counterpart, the RCC8 relations by Randell, Cui, and Cohn
A Generalised Framework for Reasoning with MultiPoint Events
"... . Allen's Interval Algebra (IA) and Vilain and Kautz's Point Algebra (PA) consider an interval and a point as basic temporal entities (i.e., events) respectively. However, in many real world situations we often need to deal with recurring events that include multiple points, multiple inter ..."
Abstract
 Add to MetaCart
. Allen's Interval Algebra (IA) and Vilain and Kautz's Point Algebra (PA) consider an interval and a point as basic temporal entities (i.e., events) respectively. However, in many real world situations we often need to deal with recurring events that include multiple points, multiple
On Binary Constraint Networks
, 1988
"... It is wellknown that general constraint satisfaction problems (CSPs) may be reduced to the binary case (BCSPs) [Pei92]. CSPs may be represented by binary constraint networks (BCNs), which can be represented by a graph with nodes for variables for which values are to be found in the domain of intere ..."
Abstract

Cited by 41 (5 self)
 Add to MetaCart
of interest, and edges labelled with binary relations between the values, which constrain the choice of solutions to those which satisfy the relations (e.g. [Mac77]). We formulate networks and algorithms in a general algebraic setting, that of Tarski's relation algebra [JonTar52], and obtain a parallel O
Database Models for Infinite and Indefinite Temporal Information
 Information Systems
, 1994
"... Representation and querying of temporal information can benefit from the integration of techniques from constraint databases, database models for indefinite information and reasoning about temporal constraints. With this perspective in mind, we present a hierarchy of temporal data models: temporal r ..."
Abstract

Cited by 36 (11 self)
 Add to MetaCart
Representation and querying of temporal information can benefit from the integration of techniques from constraint databases, database models for indefinite information and reasoning about temporal constraints. With this perspective in mind, we present a hierarchy of temporal data models: temporal
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 37 (10 self)
 Add to MetaCart
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
Fast Algebraic Methods for Interval Constraint Problems
 Annals of Mathematics and Artificial Intelligence
, 1996
"... We describe an e#ective generic method for solving constraint problems, based on Tarski's relation algebra, using pathconsistency as a pruning technique. Weinvestigate the performance of this method on interval constraint problems. Time performance is a#ected strongly by the pathconsistenc ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
We describe an e#ective generic method for solving constraint problems, based on Tarski's relation algebra, using pathconsistency as a pruning technique. Weinvestigate the performance of this method on interval constraint problems. Time performance is a#ected strongly by the path
Results 1  10
of
43