Search

The Internet of Things (IoT) has become one of the most popular technologies in recent years. Advances in computing capabilities, hardware accessibility, and wireless connectivity make possible communication between people, processes, and devices for all kinds of applications and industries. However, the deployment of this technology is confined almost entirely to tech companies, leaving end users with only access to specific functionalities. This paper presents a framework that allows users with no technical knowledge to build their own IoT applications according to their needs. To this end, a framework consisting of two building blocks is presented. A friendly interface block lets users tell the system what to do using simple operating rules such as "if the temperature is cold, turn on the heater." On the other hand, a fuzzy logic reasoner block built by experts translates the ambiguity of human language to specific actions to the actuators, such as "call the police." The proposed system can also detect and inform the user if the inserted rules have inconsistencies in real time. Moreover, a formal model is introduced, based on fuzzy description logic, for the consistency of IoT systems. Finally, this paper presents various experiments using a fuzzy logic reasoner to show the viability of the proposed framework using a smart-home IoT security system as an example. [ABSTRACT FROM AUTHOR]

In 2016, Béziau introduced the notion of genuine paraconsistent logic as logic that does not verify the principle of non-contradiction; as an important example, he presented the genuine paraconsistent logic S P 3 A in terms of three connectives , , and. In this paper, we show that S P 3 A is an axiomatic extension of C 1 through the introduction of a non-primitive deductive implication. Furthermore, we prove that S P 3 A is an algebraisable logic with Blok-Pigozzi's method. From the proof that C 1 is non-algebraisable logic, we are able to see that C ω is not algebraisable logic and studying the borders of algebrisabilty, we can give an enumerable family of new genuine, paraconsistent and non-algebraisable logics, extensions of C ω . Finally, we introduced n-valued ( n < ω) and infinite-valued C ω logic and show that they are genuine and non-algebraisable paraconsistent ones; in addition, we present semantics for this extensions of C ω by means of Fidel's structures. [ABSTRACT FROM AUTHOR]

In memoriam José Arrazola Ramírez (1962–2018) The logic |$\textbf{G}^{\prime}_3$| was introduced by Osorio et al. in 2008; it is a three-valued logic, closely related to the paraconsistent logic |$\textbf{CG}^{\prime}_3$| introduced by Osorio et al. in 2014. The logic |$\textbf{CG}^{\prime}_3$| is defined in terms of a multi-valued semantics and has the property that each theorem in |$\textbf{G}^{\prime}_3$| is a theorem in |$\textbf{CG}^{\prime}_3$|⁠. Kripke-type semantics has been given to |$\textbf{CG}^{\prime}_3$| in two different ways by Borja et al. in 2016. In this work, we continue the study of |$\textbf{CG}^{\prime}_3$|⁠ , obtaining a Hilbert-type axiomatic system and proving a soundness and completeness theorem for this logic. [ABSTRACT FROM AUTHOR]