Thomas Drakengren  Home/Search
Context Related
| ida.liu.se/ext/pur/...thesisbody.ps.gz ida.liu.se/ext/pur/tphd...paper1.ps.gz ida.liu.se/ext/pur/tphd...paper3.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: vir.liu.se/ext/pur/tphd/0498 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The problem of computing with temporal information was early recognised within the area of artificial intelligence, most notably the temporal interval algebra by Allen has become a widely used formalism for representing and computing with qualitative knowledge about relations between temporal intervals. However, the computational properties of the algebra and related formalisms are known to be bad: most problems (like satisfiability) are NP-hard. This thesis contributes to finding restrictions... (Update)
Context of citations to this paper: More
...by different authors. Examples include the approach by Barber [1993] the subclass V 23 for relating points and intervals [Drakengren, 1997, paper 1] see Section 4) and the temporal part of TMM by Dean and Boddy [1988] Also note that Golumbic and Shamir [1993] and...
.... 1996] the extended Horn clauses described in [Chandru and Hooker 1991] and the tractable set constraints described in [Drakengren 1997; Drakengren and Jonsson 1998; Drakengren and Jonsson 1997] In all of these cases our results lead to simpli cations of earlier...
Cited by: More
Reasoning About Set Constraints Applied to Tractable.. - Drakengren, Jonsson (1998) (Correct)
Building Tractable Disjunctive Constraints - Cohen, Jeavons, Jonsson.. (2000) (Correct)
Computational Complexity of Temporal Constraint Problems - Drakengren, Jonsson (1998) (Correct)
Similar documents (at the sentence level): More
12.1%: Reasoning about Action in Polynomial Time - Drakengren, Bjäreland (1997) (Correct)
11.5%: Twenty-one Large Tractable Subclasses of Allen's Algebra - Drakengren, Jonsson (1997) (Correct)
11.3%: Eight Maximal Tractable Subclasses of Allen's Algebra with.. - Drakengren, Jonsson (1997) (Correct)
Active bibliography (related documents): More All
0.6: RCC-5 and its Tractable Subclasses - Jonsson, Drakengren (1996) (Correct)
0.2: The Complexity of Set Constraints - Aiken, Kozen, Vardi, Wimmers (1993) (Correct)
0.2: Set Constraints: a Pearl in Research on Constraints - Pacholski, Podelski (1997) (Correct)
Similar documents based on text: More All
0.5: Extending the Point Algebra into the Qualitative Algebra - Krokhin, Jonsson (Correct)
0.2: Towards Aspectual Component-Based Development of.. - Tesanovic, Nyström, .. (2003) (Correct)
0.2: CAFE: Towards a Conceptual Model for Information Management in.. - Takkinen (1997) (Correct)
Related documents from co-citation: More All
3: Constraint propagation algorithms for temporal reasoning (context) - Vilain, Kautz - 1986
2: A canonical form for generalized linear constraints (context) - Lassez, McAloon - 1992
2: Qualitative reasoning about sets applied to spatial reasoning - Jonsson, Drakengren - 1996
BibTeX entry: (Update)
Thomas Drakengren. Algorithms and Complexity for Temporal and Spatial Formalisms. Doctoral dissertation, Linkoping University, October 1997. Available from http://www.ida.liu.se/publications/t-phd/1997/0498/. http://citeseer.ist.psu.edu/article/drakengren97algorithms.html More
@phdthesis{ drakengren97algorithms,
author = "T. Drakengren",
title = "Algorithms and Complexity of Temporal and Spatial Formalisms",
year = "1997",
url = "citeseer.ist.psu.edu/article/drakengren97algorithms.html" }
Citations (may not include all citations):480 An overview of the KL-ONE knowledge representation system (context) - Brachman, Schmolze - 1985
356 Computers and Intractability: A Guide to the Theory of NP-Co.. (context) - Garey, Johnson - 1979
225 A spatial logic based on regions and connection - Randell, Cui et al. - 1992
207 Attributive concept descriptions with complements (context) - Schmidt-Schau, Smolka - 1991
197 The complexity of concept languages - Donini, Lenzerini et al. - 1991
157 Soft typing with conditional types - Aiken, Wimmers et al. - 1994
131 Set Based Program Analysis - Heintze - 1992
82 A decision procedure for a class of set constraints - Heintze, Jaffar - 1990
63 Automatic computation of data set definitions (context) - Reynolds - 1969
61 Spatial reasoning with propositional logics - Bennett - 1994
52 Decidability of systems of set constraints with negative con.. - Aiken, Kozen et al. - 1994
50 Solving systems of set constraints with negated subset relat.. (context) - Gilleron, Tison et al. - 1993
50 Implementing regular tree expressions - Aiken, Murphy - 1991
42 Theoretical Computer Science (context) - Brzozowski, Leiss et al. - 1980
36 Computational properties of qualitative spatial reasoning: F.. - Nebel - 1995
34 Boolean algebras with operators (context) - J'onsson, Tarski - 1951
34 Boolean algebras with operators (context) - J'onsson, Tarski - 1952
34 Intuitionism: An Introduction (context) - Heyting - 1971
32 An engine for logic program analysis - Heintze, Jaffar - 1992
31 Directional type checking of logic programs - Aiken, Lakshman - 1994
31 A linear-programming approach to temporal reasoning - Jonsson, Backstrom - 1996
30 space decision procedure for intuitionistic propositional lo.. (context) - Hudelmaier, nlogn - 1993
23 Mathematical Intuitionism: Introduction to Proof Theory (context) - Dragalin - 1988
22 Boosting the correspondence between description logics and p.. - De Giacomo, Lenzerini - 1994
17 Tarskian set constraints - Givan, Kozen et al. - 1996
14 A complete classification of tractability in RCC - Jonsson, Drakengren - 1997
10 Sentential calculus and topology (context) - Tarski - 1956
10 Intuitionistic logic is polynomial-space complete (context) - Statman - 1979
7 Systems of negative Boolean constraints (context) - Marriott, Odersky - 1992
4 Qualitative reasoning about sets applied to spatial reasonin.. - Jonsson, Drakengren - 1996
3 The basic concepts and constructions of general topology (context) - Arkhangelskii, Fedorchuk - 1990
2 Qualitatives raumliches Schlieen: Berechnungseigenschaften u.. (context) - Renz - 1996
Documents on the same site (http://vir.liu.se/ext/pur/tphd/0498.html): More
Reasoning about Action in Polynomial Time - Drakengren, Bjäreland (1997) (Correct)
A Complete Classification of Tractability in RCC-5 - Jonsson, Drakengren (1997) (Correct)
The Computational Complexity of Relating Points with.. - Jonsson, Drakengren, .. (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