Propositional Product Logic is known to be standard finite-strong complete but not a strong complete, that is, it is complete for deductions only from finite sets of premises with respect to evaluations on the standard product chain over the real unit interval. On the other hand, Montagna has defined a logical system, an axiomatic extension of the Hájek’s Basic Fuzzy Logic BL with an storage op...

This paper describes user location and tracking on indoor scenarios through an ambient network. User location and tracking are considered in order to provide complete intelligent location based services. Imprecise location based on radio-frequency estimations can be processed by a fuzzy location algorithm in order to provide high location near to 90%. Fuzzy tracking is also provided by means of...

This paper introduces Fuzzy State Automata for control applications. They are derived from the integration of traditional nite state automata and neuro-fuzzy systems, where a nite state automaton tracks the state of the plant under control and modiies the characteristic of the neuro-fuzzy system accordingly. The main diierence with respect to existing systems is that the states of the automata ...

BL-algebras have been invented by P. Hájek [3] in order to provide an algebraic proof of the completeness theorem of “Basic Logic” (BL, for short) arising from the continuous triangular norms, familiar in the fuzzy logic framework. The above notion is generalized to an algebraic system in which the required conditions are fulfilled (Definition 2.1). Filters in BL-algebras are also defined. A fi...

Finite state automata are crucial for numerous practical algorithms of computer science. We show how to use genetic algorithms and fuzzy automata to simplify a class of FSA defined by labeled graphs and considered in the literature. Finite state automata, FSA, are well-known tools used in coding theory, text processing, image analysis and compression, speech recognition, and bioinformatics. Lab...

Fuzzy logics are designed to support logical inferences on vague or uncertain premises, and they are useful in several theoretical and applicative areas of computer science. A central paradigm in mathematical fuzzy logic, popularized by Hájek [Háj98], is based on the idea of weakening Boolean logic starting from a suitable generalization of Boolean conjunction, namely, a class of [0, 1]-valued ...

This paper presents the design of a fuzzy logic-based traffic scheduling algorithm aimed at reducing congestion for case partial obstruction bidirectional lane. Such problem is typically encountered in rail and personal rapid transportation systems with predefined fixed corridors. The proposed proportional-derivative (PD) control algorithm, serving as automaton, alternately assigns adaptive gre...

The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (Rl-monoids) are common generalizations of BL-algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain i...