Results 1  10
of
554,734
Temporal Constraint Satisfaction Problems
"... Simple Temporal Problems (STPs) are a restriction of the framework of Temporal Constraint Satisfaction Problems, tractable in polynomial time. Their expressiveness has been extended independently in two ways. First, to account for uncontrollable events, to Simple Temporal Problems with Uncertainty ( ..."
Abstract
 Add to MetaCart
Simple Temporal Problems (STPs) are a restriction of the framework of Temporal Constraint Satisfaction Problems, tractable in polynomial time. Their expressiveness has been extended independently in two ways. First, to account for uncontrollable events, to Simple Temporal Problems with Uncertainty
Temporal constraint satisfaction in matrix method
 Applied Artificial Intelligence
, 2003
"... Constraint satisfaction is a challenging problem in Interval Algebra (IA). So there are many efforts to attack this problem. After building a matrix method to deal with temporal reasoning problems, we develop basic techniques for applying the matrix method to constraint satisfaction in this paper. T ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Constraint satisfaction is a challenging problem in Interval Algebra (IA). So there are many efforts to attack this problem. After building a matrix method to deal with temporal reasoning problems, we develop basic techniques for applying the matrix method to constraint satisfaction in this paper
The complexity of temporal constraint satisfaction problems
 J. ACM
"... A temporal constraint language is a set of relations that has a firstorder definition in (Q; <), the dense linear order of the rational numbers. We present a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint langu ..."
Abstract

Cited by 34 (23 self)
 Add to MetaCart
A temporal constraint language is a set of relations that has a firstorder definition in (Q; <), the dense linear order of the rational numbers. We present a complete complexity classification of the constraint satisfaction problem (CSP) for temporal constraint languages: if the constraint
A Temporal Constraint Satisfaction ProblemSolver
"... TIM is a temporal constraint satisfaction problemsolver which enables the expert/user/developer to define and test constraint bases handling temporal concepts. It can be used either to explain or to predict. Explaining or temporally projecting backward means giving possible models or interpretation ..."
Abstract
 Add to MetaCart
TIM is a temporal constraint satisfaction problemsolver which enables the expert/user/developer to define and test constraint bases handling temporal concepts. It can be used either to explain or to predict. Explaining or temporally projecting backward means giving possible models
Coping with disjunctions in temporal constraint satisfaction problems
 In Proc. AAAI'93
, 1993
"... Pathconsistency algorithms, which are polynomial for discrete problems, are exponential when applied to problems involving quantitative temporal information. The source of complexity stems from specifying relationships between pairs of time points as disjunction of intervals. We propose a polynomia ..."
Abstract

Cited by 16 (2 self)
 Add to MetaCart
polynomial algorithm, called ULT, that approximates pathconsistency in Temporal Constraint Satisfaction Problems (TCSPs). We compare ULT empirically to pathconsistency and directional pathconsistency algorithms. When used as a preprocessing to backtracking, ULT is shown to be 10 times more e ective
An Efficient Consistency Algorithm for the Temporal Constraint Satisfaction Problem
 AI Communications
, 2004
"... Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint. The size of this global constraint is exponential in the number of time points in the original TCSP, and generalized ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint. The size of this global constraint is exponential in the number of time points in the original TCSP, and generalized
An Efficient Consistency Algorithm for the Temporal Constraint Satisfaction Problem
"... Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint. The size of this global constraint is exponential in the number of time points in the original TCSP, and generalizedarc consis ..."
Abstract
 Add to MetaCart
Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint. The size of this global constraint is exponential in the number of time points in the original TCSP, and generalized
Temporal Constraint Satisfaction Techniques in Job Shop Scheduling Problem Solving
, 1998
"... . We describe a restriction of Dechter, Meiri and Pearl's TCSPs (Temporal Constraint Satisfaction Problems) sufficiently expressive to represent any job shop scheduling problem. A solver based on the restriction is then described, which is similar to Ladkin and Reinefeld's qualitative inte ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. We describe a restriction of Dechter, Meiri and Pearl's TCSPs (Temporal Constraint Satisfaction Problems) sufficiently expressive to represent any job shop scheduling problem. A solver based on the restriction is then described, which is similar to Ladkin and Reinefeld's qualitative
On finding a solution in temporal constraint satisfaction problems
 In Proceedings of IJCAI97
, 1997
"... Computing a consistent interpretation of the variables involved in a set of temporal constraints is an important task for many areas of AI requiring temporal reasoning. We focus on the important classes of the qualitative relations in Nebel and Biirckert's ORDHorn algebra, and of the metric co ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Computing a consistent interpretation of the variables involved in a set of temporal constraints is an important task for many areas of AI requiring temporal reasoning. We focus on the important classes of the qualitative relations in Nebel and Biirckert's ORDHorn algebra, and of the metric
IOS Press An efficient consistency algorithm for the Temporal Constraint Satisfaction Problem
"... Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint. The size of this global constraint is exponential in the number of time points in the original TCSP, and generalized ..."
Abstract
 Add to MetaCart
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint. The size of this global constraint is exponential in the number of time points in the original TCSP, and generalized
Results 1  10
of
554,734