OUP, England () [27] Schmidt-Schauß, M., Smolka, G.: Attributive concept descriptions with compliments. AI 48(1), 1–26 () [28] 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.

| Author: | Toll Shaktijas |
| Country: | Azerbaijan |
| Language: | English (Spanish) |
| Genre: | Spiritual |
| Published (Last): | 7 January 2009 |
| Pages: | 67 |
| PDF File Size: | 2.59 Mb |
| ePub File Size: | 13.85 Mb |
| ISBN: | 651-3-92979-210-6 |
| Downloads: | 83396 |
| Price: | Free* [*Free Regsitration Required] |
| Uploader: | Mijora |
It can be a noun or adjective or any word acting as a noun or adjective. Network architecture Network protocol Network components Network scheduler Network performance evaluation Network service. Model of computation Formal language Automata theory Computational complexity theory Logic Semantics.

Brachman and Schmolze, Concept intersection Existential restrictions of full existential quantification. In addition to the ability to describe concepts formally, one also would like to tatributive the description of a set of concepts to ask questions about the concepts and instances described. Collective intelligence Description logic Folksonomy Geotagging Information architecture Knowledge extraction Knowledge management Knowledge representation and reasoning Library 2.
Operations on roles such as composition, inversion, etc. The complexity of existential quantification in terminological reasoning. 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 Wiith Wide Web Information retrieval.
This is not true of pronounshowever, which use different forms for different functions.
Attributive Concept Descriptions with Complements
The slow moving glacier wiped out an entire forest. These are some of descrlptions most popular:. From This Paper Figures, tables, and topics from this paper. A complete predicate consists of the verb and all accompanying modifiers and other words that receive the action of a transitive verb or complete its meaning.
The instructor gave his students A’s.
Predicates, Objects, Complements
An ontology infrastructure for the Semantic Web”. Concept intersection Deescriptions restrictions Limited existential quantification Role restriction. In that sentence, “daughter” is the direct object and “Natasha” is the object complement, which renames or describes the direct object. Direct and Indirect Objects A direct object is the receiver of action within a sentence, as in “He hit the ball. From Wikipedia, the free encyclopedia. Predicates A predicate is the completer of a sentence.
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. There are many varieties of description logics and there is an informal naming convention, roughly describing the operators allowed. See, also, pronoun cases. Dataspaces Hyperdata Linked data Rule-based systems.
There are general, spatial, temporal, spatiotemporal, and fuzzy cpmpliments logics, and each description logic features a different balance between DL expressivity and reasoning complexity by supporting different sets of mathematical constructors.
Description logic
Clearly, a sentence of this form is not privileged or special over sentences in which only constants “grounded” values appear like 2. Temporal description logic represents—and allows reasoning about—time dependent concepts and many wih approaches to this problem exist. The glacier has been melting. A compound predicate consists of two or more such predicates connected: Brachman Computational Intelligence Computer Science portal Logic portal Information science portal.
Foundations of Semantic Web Technologies. The following description of predicates comes from The Longman Handbook for Writers and Readers wiht our own:. We investigate the consequences of adding unions and complements to attributive concept descriptions employed in terminological knowledge representation languages.
Description logic was given its current name in the s.
Attributive Concept Descriptions with Complements – Semantic Scholar
Frame based description language, [3] allows:. The primary reason is that the separation can be useful when describing and formulating decision-procedures for attrbutive DL.

Interpreter Middleware Virtual machine Operating system Software quality. The expressivity is encoded in the label for a logic starting with one of the following basic logics:. This paper has highly influenced cojpliments papers.
World Wide Wed Consortium.

So why was the distinction introduced? In addition, some DLs have features that are not covered in FOL; this includes concrete domains such as integer or strings, which can be used as ranges for roles such as hasAge or hasName or an operator on roles complimentss the transitive closure of that role.
Managing Vagueness in Ontologies Fernando Ortega That garbage on the street smells bad. This is done by using a recursive definition similar to the syntax. Morton,” and learn all about subjects and simple predicates from Scholastic Rock. Two Theses of Knowledge Representation: Articles with short description. Description logics DL are a family of formal knowledge representation languages.
Complements Since this page is about the completers of thoughts, it is appropriate to include a brief description of complements. Cryptography Formal methods Security services Intrusion detection system Hardware security Network security Information security Application security. Algorithm design Descriptkons of algorithms Algorithmic efficiency Randomized algorithm Computational geometry.
