(Enter summary)
Abstract: We start with the assumption that temporal
knowledge usually captured by constraint networks
can be represented and queried more effectively
by using the scheme of indefinite constraint
databases proposed by Koubarakis. Although
query evaluation in this scheme is in general
a hard computational problem, we demonstrate
that there are several interesting cases
where query evaluation can be done in PTIME.
These tractability results are original and subsume
previous results by van Beek, Brusoni,... (Update)
Context of citations to this paper: More
.... been more than a constraint network based temporal reasoner 3 The results in the rest of the paper are taken verbatim from (Koubarakis Skiadopoulos 1999). 4 So all previous results on various classes of temporal and spatial constraints will actually be crucial here...
...satisfaction problems. The methodology of this paper has also been applied to the problem of querying temporal constraint networks in [32]. The paper is organized as follows. The next section reviews the scheme of indefinite constraint databases and a method for query...
Cited by: More
Tractable Disjunctions of Linear Constraints: Basic Results and .. - Koubarakis (1996)
(Correct)
Tractable Query Answering in Indefinite Constraint Databases.. - Koubarakis (1999)
(Correct)
Querying Indefinite Temporal and Spatial Information: A.. - Koubarakis, Skiadopoulos
(Correct)
Active bibliography (related documents): More All
0.2: Global Consistency in Interval Algebra Networks.. - Bessière.. (1996)
(Correct)
0.2: Characterizing Temporal Abductive Diagnosis - Brusoni, Console, Terenziani.. (1996)
(Correct)
0.2: An Efficient Algorithm for Temporal Abduction - Brusoni, Console, Terenziani, .. (1997)
(Correct)
Similar documents based on text: More All
0.5: Tractable Disjunctions of Linear Constraints - Koubarakis (1996)
(Correct)
0.4: Business Process Modelling and Design: A Formal Model and .. - Koubarakis, Plexousakis
(Correct)
0.4: Subscription Management and Charging for Value Added.. - Koutsopoulou, Farmakis (2001)
(Correct)
Related documents from co-citation: More All
5: Constraint propagation algorithms for temporal reasoning (context) - Vilain, Kautz - 1986
4: Constraint Query Languages
- Kanellakis, Kuper et al. - 1990
3: A linear-programming approach to temporal reasoning
- Jonsson, Backstrom - 1996
BibTeX entry: (Update)
Koubarakis, M., and Skiadopoulos, S. 1999. Querying Temporal Constraint Networks in PTIME. In Proceedings of AAAI-99. Forthcoming. http://citeseer.ist.psu.edu/koubarakis99querying.html More
@inproceedings{ koubarakis99querying,
author = "Manolis Koubarakis and Spiros Skiadopoulos",
title = "Querying Temporal Constraint Networks in {PTIME}",
booktitle = "{AAAI}/{IAAI}",
pages = "745-750",
year = "1999",
url = "citeseer.ist.psu.edu/koubarakis99querying.html" }
Citations (may not include all citations):
1044
Maintaining Knowledge about Temporal Intervals (context) - Allen - 1983
379
The Complexity of Relational Query Languages (context) - Vardi - 1982
315
Constraint Query Languages
- Kanellakis, Kuper et al. - 1990
284
Constraint Propagation Algorithms for Temporal Reasoning: A .. (context) - Vilain, Kautz et al. - 1989
106
Temporal Data Base Management (context) - Dean, McDermott - 1987
101
Incomplete Information in Relational Databases (context) - Imielinski, Lipski - 1984
96
Telos: A Language for Representing Knowledge About Informati.. (context) - Mylopoulos, Borgida et al. - 1990
53
Deciding Linear Inequalities by Computing Loop Residues (context) - Shostak - 1981
41
the Representation and Querying of Sets of Possible Worlds
- Abiteboul, Kanellakis et al. - 1991
31
A Linear Programming Approach to Temporal Reasoning
- Jonsson, Backstrom - 1996
30
The Problem of Incomplete Information in Relational Database.. (context) - Grahne - 1991
25
Expressing Combinatorial Optimization Problems by Linear Pro.. (context) - Yannakakis - 1988
15
The Complexity of Query Evaluation in Indefinite Temporal Co..
- Koubarakis
13
Beyond Finite Domains
- Jaffar, Maher et al. - 1994
12
From Local to Global Consistency in Temporal Constraint Netw..
- Koubarakis
8
the computational complexity of querying bounds on differenc.. (context) - Brusoni, Console et al. - 1995
8
Extending temporal relational databases to deal with impreci.. (context) - Brusoni, Console et al. - 1995
8
Managing Disjunction for Practical Temporal Reasoning
- Schrag, Boddy et al. - 1992
7
LaTeR: a general purpose manager of temporal information (context) - Brusoni, Console et al. - 1994
1
About Linearly Ordered Domains (context) - Ordered, Version et al. - 1997
1
Efficient Algorithms for Qualitative Reasoning about Time (context) - Intelligence, -- et al. - 1995
1
Reasoning about temporal relations: A maximal tractable subc.. (context) - on, Systems et al. - 1995
1
Exact and Approximate Reasoning about Temporal Relations (context) - in, -- et al. - 1990
1
Temporal Constraint Networks (context) - Intelligence, Dechter et al. - 1991
Documents on the same site (http://www.di.uoa.gr/~manolis/conferences.html): More
Tractable Disjunctive Constraints - Cohen, Jeavons, Koubarakis (1996)
(Correct)
Tractable Disjunctions of Linear Constraints - Koubarakis (1996)
(Correct)
From Local to Global Consistency in Temporal Constraint Networks - Koubarakis (1995)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC