Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

You searched for subject:(Tracatable description logics). One record found.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Μαΐλης, Θεόφιλος. Επεκτάσεις ασαφών περιγραφικών λογικών με κανόνες και απτά πεδία.

Degree: 2012, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ)

One of the most important topics in Computer Science is Knowledge Representation and Reasoning. Description Logics is a family of formal knowledge representation languages used in artificial intelligence for formal reasoning on the concepts of an application domain. Nevertheless, since our knowledge about certain domains contains uncertainty and imprecision, the knowledge representation languages should also have the ability to incorporate this kind of information. For this reason, fuzzy Description Logics, that form an extension of crisp Description Logics capable of representing uncertainty and imprecision, have been proposed. These extensions allow us, not only to adequately represent concepts such as near, far, much, little, etc., but also to perform reasoning. On this ground, on the one hand, expressive fuzzy Description Logic languages such as fKD - SHIN have been proposed, on the other hand reasoning engines such as FiRE have been developed for the previously mentioned languages. The main objective of this thesis is to extend fuzzy Description Logics with two types of expressiveness that have not been adequately studied. The first type refers to extending fuzzy Description Logic languages with rules similar to those already been introduced in other logic formalisms such as Logic Programming, while the second refers to extending fuzzy Description Logics so as to incorporate data types such as numerical data. These types of expressiveness are useful in various applications –such as medical and image processing applications–. The main difficulty in our work was not to provide the semantics of a fuzzy Description Logic language, but to find a sound, complete, and terminating algorithm for the specific language. The main obstacle towards this direction is the high complexity of the proposed languages. In the worst case, we may propose a DL extension which is undecidable. During our research, we have proposed fuzzy CARIN, a knowledge representation language combining fuzzy Description Logics with (Horn Rules). Fuzzy CARIN incorporates fuzzy logic operators to the non recursive CARIN language and is able to solve reasoning problems with conjunctive queries and unions of conjunctive queries as well as the problem of existential entailment. Throughout the study of fuzzy CARIN and in our attempt to develop a reasoning engine for the specific expressiveness, the main problem we faced was the high complexity of the proposed language (and consequently its corresponding reasoning algorithm). Thus, we later focused our attention to the study of polynomial complexity languages, such as those of the EL family. Initially we proposed the fuzzy EL++ language, i.e. its syntax, semantics together with a sound and complete reasoning algorithm which was proved to have polynomial complexity. We then studied the limitations that have to be imposed so that the fuzzy EL++ language may incorporate concrete domains, i.e. to be able to adequately represent data types such as numerical data, without losing its polynomial complexity. This…

Subjects/Keywords: Περιγραφικές λογικές; Ασαφείς περιγραφικές λογικές; Ασαφής λογική; Απτά πεδία; Τύποι δεδομένων; Συλλογιστική; Βατές περιγραφικές λογικές; Description logics; Fuzzy description logics; Fuzzy logic; Concrete domains; Datatypes; Reasoning; Tracatable description logics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Μαΐλης, . . (2012). Επεκτάσεις ασαφών περιγραφικών λογικών με κανόνες και απτά πεδία. (Thesis). National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Retrieved from http://hdl.handle.net/10442/hedi/28667

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Μαΐλης, Θεόφιλος. “Επεκτάσεις ασαφών περιγραφικών λογικών με κανόνες και απτά πεδία.” 2012. Thesis, National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ). Accessed June 17, 2019. http://hdl.handle.net/10442/hedi/28667.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Μαΐλης, Θεόφιλος. “Επεκτάσεις ασαφών περιγραφικών λογικών με κανόνες και απτά πεδία.” 2012. Web. 17 Jun 2019.

Vancouver:

Μαΐλης . Επεκτάσεις ασαφών περιγραφικών λογικών με κανόνες και απτά πεδία. [Internet] [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2012. [cited 2019 Jun 17]. Available from: http://hdl.handle.net/10442/hedi/28667.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Μαΐλης . Επεκτάσεις ασαφών περιγραφικών λογικών με κανόνες και απτά πεδία. [Thesis]. National Technical University of Athens (NTUA); Εθνικό Μετσόβιο Πολυτεχνείο (ΕΜΠ); 2012. Available from: http://hdl.handle.net/10442/hedi/28667

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.