9,944 research outputs found
On the similarity relation within fuzzy ontology components
Ontology reuse is an important research issue. Ontology
merging, integration, mapping, alignment and versioning
are some of its subprocesses. A considerable research work has
been conducted on them. One common issue to these subprocesses
is the problem of defining similarity relations among ontologies
components. Crisp ontologies become less suitable in all domains
in which the concepts to be represented have vague, uncertain
and imprecise definitions. Fuzzy ontologies are developed to
cope with these aspects. They are equally concerned with the
problem of ontology reuse. Defining similarity relations within
fuzzy context may be realized basing on the linguistic similarity
among ontologies components or may be deduced from their
intentional definitions. The latter approach needs to be dealt
with differently in crisp and fuzzy ontologies. This is the scope
of this paper.ou
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
Can many-valued logic help to comprehend quantum phenomena?
Following {\L}ukasiewicz, we argue that future non-certain events should be
described with the use of many-valued, not 2-valued logic. The
Greenberger-Horne-Zeilinger `paradox' is shown to be an artifact caused by
unjustified use of 2-valued logic while considering results of future
non-certain events. Description of properties of quantum objects before they
are measured should be performed with the use of propositional functions that
form a particular model of infinitely-valued {\L}ukasiewicz logic. This model
is distinguished by specific operations of negation, conjunction, and
disjunction that are used in it.Comment: 10 pages, no figure
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
A Description Logic Framework for Commonsense Conceptual Combination Integrating Typicality, Probabilities and Cognitive Heuristics
We propose a nonmonotonic Description Logic of typicality able to account for
the phenomenon of concept combination of prototypical concepts. The proposed
logic relies on the logic of typicality ALC TR, whose semantics is based on the
notion of rational closure, as well as on the distributed semantics of
probabilistic Description Logics, and is equipped with a cognitive heuristic
used by humans for concept composition. We first extend the logic of typicality
ALC TR by typicality inclusions whose intuitive meaning is that "there is
probability p about the fact that typical Cs are Ds". As in the distributed
semantics, we define different scenarios containing only some typicality
inclusions, each one having a suitable probability. We then focus on those
scenarios whose probabilities belong to a given and fixed range, and we exploit
such scenarios in order to ascribe typical properties to a concept C obtained
as the combination of two prototypical concepts. We also show that reasoning in
the proposed Description Logic is EXPTIME-complete as for the underlying ALC.Comment: 39 pages, 3 figure
- …