NEXP TIME-complete description logics with concrete domains.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tocl/Lutz04
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tocl/Lutz04
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Carsten_Lutz
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1024922.1024925
>
foaf:
homepage
<
https://doi.org/10.1145/1024922.1024925
>
dc:
identifier
DBLP journals/tocl/Lutz04
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1024922.1024925
(xsd:string)
dcterms:
issued
2004
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tocl
>
rdfs:
label
NEXP TIME-complete description logics with concrete domains.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Carsten_Lutz
>
swrc:
number
4
(xsd:string)
swrc:
pages
669-705
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tocl/Lutz04/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tocl/Lutz04
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tocl/tocl5.html#Lutz04
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1024922.1024925
>
dc:
subject
Computational complexity, NExpTime-completeness, concrete domains, description logic, domino problem, post correspondence problem
(xsd:string)
dc:
title
NEXP TIME-complete description logics with concrete domains.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
5
(xsd:string)