OUP, England ()  Schmidt-Schauß, M., Smolka, G.: Attributive concept descriptions with compliments. AI 48(1), 1–26 ()  Segerberg, K.: A note. Sattler, U.: Description logics for the representation of aggregated objects. Schmidt-Schauß, M., Smolka, G.: Attributive concept descriptions with compliments. A core AL-based description logic is the Attributive (Concept) Language with Complements (ALC), in which, unlike AL, the complement of any concept is allowed.
|Published (Last):||4 April 2011|
|PDF File Size:||18.93 Mb|
|ePub File Size:||18.13 Mb|
|Price:||Free* [*Free Regsitration Required]|
In the early ’90s, the introduction of a new tableau based algorithm paradigm allowed efficient reasoning on more expressive DL. Database management system Information storage systems Enterprise information system Social information systems Geographic information system Decision support system Process control system Multimedia information system Data mining Digital library Computing platform Digital marketing World Wide Web Information retrieval.
Concept intersection Universal restrictions Limited existential quantification Role restriction.
Description logic – Wikipedia
Both “money” [the direct object] and “Raoul” [the indirect object] are said to be the verb complements of this sentence. His behavior has been outrageous. An object complement follows and modifies or refers to a direct object. The noun “Vice President” complements the direct object “Dogbreath”; the adjective “happy” complements the object “him.
Computer Science portal Logic portal Information science portal. A simple predicate consists of only a verb, verb string, or compound verb: Functional properties, a special case of uniqueness quantification.
It can be a noun or adjective or any word acting as a noun or adjective. Thus, it is useful to have a way to talk about that specific part of the knowledge base.
The more operators one includes in a logic and the more complicated the T-box having cycles, allowing non-atomic concepts to include each otherusually the higher the computational complexity is for each of these problems see Description Logic Complexity Navigator for examples. Description logic is related to—but developed independently of— modal logic ML.
Previous to this it was called chronologically: Expressiveness and tractability in knowledge representation and reasoning Hector J. Not having UNA means that two concepts with different names may be dith by some inference to be shown to be equivalent. Showing of 16 references. This paper has highly influenced other papers. Dexcriptions This Paper Figures, tables, and topics from this paper. Many DLs are decidable fragments of first-order logic FOL  and are usually fragments of two-variable logic or guarded logic.
Many DLs are more expressive than propositional logic but less expressive than first-order logic. The glacier has been melting.
Knowledge representation languages Non-classical logic Information science Artificial intelligence. Other constructors have no corresponding construction in FOL including restrictions on roles for attribufive, inverse, transitivity and functionality. It is shown that deciding coherence and subsumption of such descriptions are PSPACE-complete problems that can be decided with linear space. Dataspaces Hyperdata Linked data Rule-based systems. In that sentence, “daughter” attribytive the direct object and “Natasha” is the object complement, which renames or describes the direct object.
A complkments predicate consists of the verb and all accompanying modifiers and other words that receive the action of a transitive verb or complete its meaning. Incidentally, the word me and similar object-form pronouns such as him, us, them is not always an indirect object; it will also serve, sometimes, as a direct object.
References Publications referenced by this paper. Citations Publications citing this paper.