Results 1  10
of
121,056
Foundations of Temporal Constraint Databases
, 1994
"... An important requirement of advanced temporal applications is the ability to deal with definite, indefinite, finite and infinite temporal information. There is currently no database model which offers this functionality in a single unified framework. We argue that the combination of relational datab ..."
Abstract

Cited by 18 (7 self)
 Add to MetaCart
databases and temporal constraints offers a powerful framework which addresses these needs. In this thesis we develop the foundations of a theory of temporal constraint databases and indefinite temporal constraint databases. At first, we study a hierarchy of parameterized database models: ML relational
On Fuzzy Temporal Constraint Networks
 MATHWARE AND SOFT COMPUTING
, 1994
"... Temporal Constraint Networks are a welldefined, natural and efficient formalism for representing temporal knowledge based on metric temporal constraints. They support the representation of both metric and some qualitative temporal relations and are provided with efficient algorithms based on CS ..."
Abstract

Cited by 25 (0 self)
 Add to MetaCart
Temporal Constraint Networks are a welldefined, natural and efficient formalism for representing temporal knowledge based on metric temporal constraints. They support the representation of both metric and some qualitative temporal relations and are provided with efficient algorithms based
Temporal Constraint Reasoning with Preferences
, 2001
"... A number of reasoning problems involving the manipulation of temporal information can be viewed as implicitly inducing an ordering of decisions involving time (associated with durations or orderings of events) on the basis of preferences. For example, a pair of events might be constrained to o ..."
Abstract

Cited by 71 (10 self)
 Add to MetaCart
to occur in a certain order, and, in addition, it might be preferable that the delay between them be as large, or as small, as possible. This paper explores problems in which a set of temporal constraints is specified, each with preference criteria for making local decisions about the events involved
Backtracking Algorithms for Disjunctions of Temporal Constraints
 Artificial Intelligence
, 1998
"... We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the form x1 \Gamma y1 r1 : : : xn \Gamma yn rn , where x1 : : : xn ; y1 : : : yn are variables ranging over the real numbers, r1 : : : rn are real constants, and n 1. W ..."
Abstract

Cited by 118 (2 self)
 Add to MetaCart
We extend the framework of simple temporal problems studied originally by Dechter, Meiri and Pearl to consider constraints of the form x1 \Gamma y1 r1 : : : xn \Gamma yn rn , where x1 : : : xn ; y1 : : : yn are variables ranging over the real numbers, r1 : : : rn are real constants, and n 1
The Complexity of Temporal Constraint Languages
"... 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
 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
Dense Time and Temporal Constraints with ≠
 IN PROC. 3RD INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING (KR92
, 1992
"... In some temporal reasoning systems, inequations can give rise to disjunctions of inequations when variable elimination is performed. Motivated by this observation, we extend previous research on temporal constraints by considering disjunctions of inequations (under the assumption that time is dense. ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In some temporal reasoning systems, inequations can give rise to disjunctions of inequations when variable elimination is performed. Motivated by this observation, we extend previous research on temporal constraints by considering disjunctions of inequations (under the assumption that time is dense
Temporal Constraint Networks in Action
"... This paper presents an integration of the well known Temporal Constraint Networks representation into a causal approach for reasoning about actions called AL² [9]. As a result, temporal constraints are allowed in the conditions of the causal rules that describe the domain behavior. We show the adequ ..."
Abstract
 Add to MetaCart
This paper presents an integration of the well known Temporal Constraint Networks representation into a causal approach for reasoning about actions called AL² [9]. As a result, temporal constraints are allowed in the conditions of the causal rules that describe the domain behavior. We show
Deductive planning with temporal constraints
 Logical Formalizations of Commonsense Reasoning: Papers from 2007 AAAI Spring Symposium
, 2007
"... papers/notes/magnussonanddoherty/ Temporal Action Logic is a well established logical formalism for reasoning about action and change using an explicit time representation that makes it suitable for applications that involve complex temporal reasoning. We take advantage of constraint satisfaction ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
papers/notes/magnussonanddoherty/ Temporal Action Logic is a well established logical formalism for reasoning about action and change using an explicit time representation that makes it suitable for applications that involve complex temporal reasoning. We take advantage of constraint satisfaction
Temporal Constraints: A Survey
, 1998
"... . Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between them. Information is represented as a Constraint Satisfaction Problem (CSP) where variables denote event times and constraints re ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between them. Information is represented as a Constraint Satisfaction Problem (CSP) where variables denote event times and constraints
Results 1  10
of
121,056