11,310 research outputs found
About Nonstandard Neutrosophic Logic (Answers to Imamura 'Note on the Definition of Neutrosophic Logic')
In order to more accurately situate and fit the neutrosophic logic into the
framework of nonstandard analysis, we present the neutrosophic inequalities,
neutrosophic equality, neutrosophic infimum and supremum, neutrosophic standard
intervals, including the cases when the neutrosophic logic standard and
nonstandard components T, I, F get values outside of the classical real unit
interval [0, 1], and a brief evolution of neutrosophic operators. The paper
intends to answer Imamura criticism that we found benefic in better
understanding the nonstandard neutrosophic logic, although the nonstandard
neutrosophic logic was never used in practical applications.Comment: 16 page
Simplifying Inductive Schemes in Temporal Logic
In propositional temporal logic, the combination of the connectives "tomorrow" and "always in the future" require the use of induction tools. In this paper, we present a classification of inductive schemes for propositional linear temporal logic that allows the detection of loops in decision procedures. In the design of automatic theorem provers, these schemes are responsible for the searching of efficient solutions for the detection and management of loops. We study which of these schemes have a good behavior in order to give a set of reduction rules that allow us to compute these schemes efficiently and, therefore, be able to eliminate these loops. These reduction laws can be applied previously and during the execution of any automatic theorem prover. All the reductions introduced in this paper can be considered a part of the process for obtaining a normal form of a given formula
Understanding Predication in Conceptual Spaces
We argue that a cognitive semantics has to take into account the possibly
partial information that a cognitive agent has of the world. After discussing
Gärdenfors's view of objects in conceptual spaces, we offer a number of viable
treatments of partiality of information and we formalize them by means of alternative
predicative logics. Our analysis shows that understanding the nature of simple
predicative sentences is crucial for a cognitive semantics
Fredkin Gates for Finite-valued Reversible and Conservative Logics
The basic principles and results of Conservative Logic introduced by Fredkin
and Toffoli on the basis of a seminal paper of Landauer are extended to
d-valued logics, with a special attention to three-valued logics. Different
approaches to d-valued logics are examined in order to determine some possible
universal sets of logic primitives. In particular, we consider the typical
connectives of Lukasiewicz and Godel logics, as well as Chang's MV-algebras. As
a result, some possible three-valued and d-valued universal gates are described
which realize a functionally complete set of fundamental connectives.Comment: 57 pages, 10 figures, 16 tables, 2 diagram
Using fuzzy logic to handle the users' semantic descriptions in a music retrieval system
This paper provides an investigation of the potential application of fuzzy logic to semantic music recommendation. We show that a set of affective/emotive, structural and kinaesthetic descriptors can be used to formulate a query which allows the retrieval of intended music. A semantic music recommendation system was built, based on an elaborate study of potential users of music information retrieval systems. In this study analysis was made of the descriptors that best characterize the user's understanding of music. Significant relationships between expressive and structural descriptions of music were found. A straightforward fuzzy logic methodology was then applied to handle the quality ratings associated with the descriptions. Rigorous real-world testing of the semantic music recommendation system revealed high user satisfaction
- …