Hintikka-Style Semantic Games for Fuzzy Logics

2014 ◽  
pp. 193-210 ◽  
Author(s):  
Christian G. Fermüller
Keyword(s):  
Fuzzy Logics

Modeling and Solution Techniques Used for Hydro Generation Scheduling

Water ◽  
2019 ◽  
Vol 11 (7) ◽  
pp. 1392 ◽  
Author(s):  
Iram Parvez ◽  
JianJian Shen ◽  
Mehran Khan ◽  
Chuntian Cheng
Keyword(s):  
Genetic Algorithm ◽  
Dynamic Programming ◽  
Stochastic Programming ◽  
Short Interval ◽  
Optimization Techniques ◽  
Mixed Integer ◽  
Fuzzy Logics ◽  
Spinning Reserve ◽  
Lagrange Relaxation ◽  
Generation Scheduling

The hydro generation scheduling problem has a unit commitment sub-problem which deals with start-up/shut-down costs related hydropower units. Hydro power is the only renewable energy source for many countries, so there is a need to find better methods which give optimal hydro scheduling. In this paper, the different optimization techniques like lagrange relaxation, augmented lagrange relaxation, mixed integer programming methods, heuristic methods like genetic algorithm, fuzzy logics, nonlinear approach, stochastic programming and dynamic programming techniques are discussed. The lagrange relaxation approach deals with constraints of pumped storage hydro plants and gives efficient results. Dynamic programming handles simple constraints and it is easily adaptable but its major drawback is curse of dimensionality. However, the mixed integer nonlinear programming, mixed integer linear programming, sequential lagrange and non-linear approach deals with network constraints and head sensitive cascaded hydropower plants. The stochastic programming, fuzzy logics and simulated annealing is helpful in satisfying the ramping rate, spinning reserve and power balance constraints. Genetic algorithm has the ability to obtain the results in a short interval. Fuzzy logic never needs a mathematical formulation but it is very complex. Future work is also suggested.

scholarly journals Generalized continuous and left-continuous t-norms arising from algebraic semantics for fuzzy logics

2010 ◽  
Vol 180 (8) ◽  
pp. 1354-1372 ◽  
Author(s):  
Carles Noguera ◽  
Francesc Esteva ◽  
Lluís Godo
Keyword(s):  
Algebraic Semantics ◽  
Fuzzy Logics

scholarly journals Exploring Paraconsistency in Degree-Preserving Fuzzy Logics

2013 ◽  
Author(s):  
Rodolfo Ertola ◽  
Francesc Esteva ◽  
Tommaso Flaminio ◽  
Lluis Godo ◽  
Carles Noguera
Keyword(s):  
Fuzzy Logics

A Note on Saturated Models for Many-Valued Logics

2015 ◽  
Vol 65 (4) ◽  
Author(s):  
Tommaso Flaminio ◽  
Matteo Bianchi
Keyword(s):  
Representation Theorem ◽  
Amalgamation Property ◽  
Short Paper ◽  
Fuzzy Logics ◽  
Saturated Models ◽  
Joint Embedding ◽  
Joint Embedding Property

AbstractIn this short paper we will discuss on saturated and κ-saturated models of many-valued (t-norm based fuzzy) logics. Using these peculiar structures we show a representation theorem à la Di Nola for several classes of algebras including MV, Gödel, product, BL, NM and WNM-algebras. Then, still using (κ)-saturated algebras, we finally show that some relevant subclasses of algebras related to many-valued logics also enjoy the joint embedding property and the amalgamation property.

Many-Valued Logics, Fuzzy Logics and Graded Consequence: A Comparative Appraisal

2013 ◽  
pp. 197-209 ◽  
Author(s):  
Soma Dutta ◽  
Sanjukta Basu ◽  
Mihir Kr. Chakraborty
Keyword(s):  
Fuzzy Logics

SUBSTRUCTURAL INQUISITIVE LOGICS

2019 ◽  
Vol 12 (2) ◽  
pp. 296-330 ◽  
Author(s):  
VÍT PUNČOCHÁŘ
Keyword(s):  
Fuzzy Logic ◽  
General Theory ◽  
Propositional Logic ◽  
Substructural Logics ◽  
Substructural Logic ◽  
Fuzzy Logics ◽  
Inquisitive Semantics ◽  
Semantic Framework ◽  
Noncommutative Version ◽  
Image Position

AbstractThis paper shows that any propositional logic that extends a basic substructural logic BSL (a weak, nondistributive, nonassociative, and noncommutative version of Full Lambek logic with a paraconsistent negation) can be enriched with questions in the style of inquisitive semantics and logic. We introduce a relational semantic framework for substructural logics that enables us to define the notion of an inquisitive extension of λ, denoted as ${\lambda ^?}$, for any logic λ that is at least as strong as BSL. A general theory of these “inquisitive extensions” is worked out. In particular, it is shown how to axiomatize ${\lambda ^?}$, given the axiomatization of λ. Furthermore, the general theory is applied to some prominent logical systems in the class: classical logic Cl, intuitionistic logic Int, and t-norm based fuzzy logics, including for example Łukasiewicz fuzzy logic Ł. For the inquisitive extensions of these logics, axiomatization is provided and a suitable semantics found.

Sign in / Sign up

Export Citation Format

Share Document