Concrete Domains and Nominals United
نویسندگان
چکیده
While the complexity of concept satisfiability in both ALCO, the basic description logic ALC enriched with nominals, and ALC(D), the extension of ALC with concrete domains, is known to be PSpace-complete, in this article we show that the combination ALCO(D) of these two logics can have a NExpTime-hard concept satisfiability problem (depending on the concrete domain D used). The proof is by a reduction of a NExpTime-complete variant of the domino problem to ALCO(D)concept satisfiability.
منابع مشابه
Probabilistic EL with Nominals and Concrete Domains
We present MEL (M denotes Markov logic networks) an extension of the log-linear description logics EL-LL with concrete domains, nominals, and instances. We use Markov logic networks (MLNs) in order to find the most probable, classified and coherent EL ontology from anMEL knowledge base. In particular, we develop a novel way to deal with concrete domains by extending MLN’s cutting plane inferenc...
متن کاملTowards Log-Linear Logics with Concrete Domains
We present MEL (M denotes Markov logic networks) an extension of the log-linear description logics EL-LL with concrete domains, nominals, and instances. We use Markov logic networks (MLNs) in order to find the most probable, classified and coherent EL ontology from an MEL knowledge base. In particular, we develop a novel way to deal with concrete domains (also known as datatypes) by extending M...
متن کاملChair for Automata Theory LTCS – Report Keys , Nominals , and Concrete Domains
Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to “concrete” domains such as numbers and strings with built-in predicates such as <, +, and prefix-of. These hybrid DLs have turned out to be quite useful for reasoning about conceptual models of information systems, and as the basis for expressive ontology languages. We propose to fu...
متن کاملKeys, Nominals, and Concrete Domains
Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to “concrete” domains like numbers and strings with built-in predicates such as <, +, and prefix-of. These hybrid DLs have turned out to be useful in several application areas, such as providing the basis for expressive ontology languages. We propose to further extend such DLs with key...
متن کاملHeuristic Disambiguation of Deverbal Nominals in Greek
Deverbal nouns exhibit both nominal and verbal syntactic behaviour: they operate as concrete nouns, but also participate in verbal constructions where they require arguments and accept aspectual modification. We first describe the phenomenon and discuss theoretical analyses proposed in the literature, and then propose a methodology for applying the theoretical results to parsing of nominal phra...
متن کامل