default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Drakengren
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[r1]Thomas Drakengren, Peter Jonsson:
Computational Complexity of Temporal Constraint Problems. Handbook of Temporal Reasoning in Artificial Intelligence 2005: 197-218
1990 – 1999
- 1999
- [j9]Peter Jonsson, Thomas Drakengren, Christer Bäckström:
Computational Complexity of Relating Time Points with Intervals. Artif. Intell. 109(1-2): 273-295 (1999) - [j8]Thomas Drakengren, Marcus Bjäreland:
Reasoning About Action in Polynomial Time. Artif. Intell. 115(1): 1-24 (1999) - [c5]Thomas Drakengren, Marcus Bjäreland:
Expressive Reasoning about Action in Nondeterministic Polynomial Time. IJCAI 1999: 166-171 - 1998
- [j7]Thomas Drakengren, Peter Jonsson:
A Complete Classification of Tractability in Allen's Algebra Relative to Subsets of Basic Relations. Artif. Intell. 106(2): 205-219 (1998) - [j6]Thomas Drakengren, Peter Jonsson:
Reasoning About Set Constraints Applied to Tractable Inference in Intuitionistic Logic. J. Log. Comput. 8(6): 855-875 (1998) - [j5]Thomas Drakengren:
A Decidable Canonical Representation of the Compact Elements in Scott's Reflexive Domain in P-omega. Theor. Comput. Sci. 193(1-2): 181-195 (1998) - 1997
- [j4]Thomas Drakengren, Peter Jonsson:
Twenty-One Large Tractable Subclasses of Allen's Algebra. Artif. Intell. 93: 297-319 (1997) - [j3]Peter Jonsson, Thomas Drakengren:
A Complete Classification of Tractability in RCC-5. J. Artif. Intell. Res. 6: 211-221 (1997) - [j2]Thomas Drakengren, Peter Jonsson:
Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time. J. Artif. Intell. Res. 7: 25-45 (1997) - [c4]Thomas Drakengren, Marcus Bjäreland:
Reasoning about Action in Polynomial Time. IJCAI 1997: 1447-1453 - [c3]Thomas Drakengren, Peter Jonsson:
Towards a Complete Classification of Tractability in Allen's Algebra. IJCAI 1997: 1466-1475 - [i2]Peter Jonsson, Thomas Drakengren:
A Complete Classification of Tractability in RCC-5. CoRR cs.AI/9706102 (1997) - [i1]Thomas Drakengren, Peter Jonsson:
Eight Maximal Tractable Subclasses of Allen's Algebra with Metric Time. CoRR cs.AI/9707102 (1997) - 1996
- [j1]Thomas Drakengren:
Uniqueness of Scott's Reflexive Domain in P-omega. Theor. Comput. Sci. 155(1): 267-276 (1996) - [c2]Thomas Drakengren, Peter Jonsson:
Maximal Tractable Subclasses of Allen's Interval Algebra: Preliminary Report. AAAI/IAAI, Vol. 1 1996: 389-394 - [c1]Peter Jonsson, Thomas Drakengren, Christer Bäckström:
Tractable Subclasses of the Point-Interval Algebra: A Complete Classification. KR 1996: 352-363
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
