63 research outputs found
Reasoning within Fuzzy Description Logics
Description Logics (DLs) are suitable, well-known, logics for managing
structured knowledge. They allow reasoning about individuals and well defined
concepts, i.e., set of individuals with common properties. The experience in
using DLs in applications has shown that in many cases we would like to extend
their capabilities. In particular, their use in the context of Multimedia
Information Retrieval (MIR) leads to the convincement that such DLs should
allow the treatment of the inherent imprecision in multimedia object content
representation and retrieval. In this paper we will present a fuzzy extension
of ALC, combining Zadeh's fuzzy logic with a classical DL. In particular,
concepts becomes fuzzy and, thus, reasoning about imprecise concepts is
supported. We will define its syntax, its semantics, describe its properties
and present a constraint propagation calculus for reasoning in it
A Neutrosophic Description Logic
Description Logics (DLs) are appropriate, widely used, logics for managing
structured knowledge. They allow reasoning about individuals and concepts, i.e.
set of individuals with common properties. Typically, DLs are limited to
dealing with crisp, well defined concepts. That is, concepts for which the
problem whether an individual is an instance of it is yes/no question. More
often than not, the concepts encountered in the real world do not have a
precisely defined criteria of membership: we may say that an individual is an
instance of a concept only to a certain degree, depending on the individual's
properties. The DLs that deal with such fuzzy concepts are called fuzzy DLs. In
order to deal with fuzzy, incomplete, indeterminate and inconsistent concepts,
we need to extend the fuzzy DLs, combining the neutrosophic logic with a
classical DL. In particular, concepts become neutrosophic (here neutrosophic
means fuzzy, incomplete, indeterminate, and inconsistent), thus reasoning about
neutrosophic concepts is supported. We'll define its syntax, its semantics, and
describe its properties.Comment: 18 pages. Presented at the IEEE International Conference on Granular
Computing, Georgia State University, Atlanta, USA, May 200
Towards a Proof Theory of G\"odel Modal Logics
Analytic proof calculi are introduced for box and diamond fragments of basic
modal fuzzy logics that combine the Kripke semantics of modal logic K with the
many-valued semantics of G\"odel logic. The calculi are used to establish
completeness and complexity results for these fragments
Extending ontological categorization through a dual process conceptual architecture
In this work we present a hybrid knowledge representation system aiming at extending the representational and reasoning capabilities of classical ontologies by taking into account the theories of typicality in conceptual processing. The system adopts a categorization process inspired to the dual process theories and, from a representational perspective, is equipped with a heterogeneous knowledge base that couples conceptual spaces and ontological formalisms. The system has been experimentally assessed in a conceptual categorization task where common sense linguistic descriptions were given in input, and the corresponding target concepts had to be identified. The results show that the proposed solution substantially improves the representational and reasoning \ue2\u80\u9cconceptual\ue2\u80\u9d capabilities of standard ontology-based systems
- …