A stepwise fuzzy linear programming model with possibility and necessity relations

Linear programming (LP) is the most widely used optimization technique for solving real-life problems because of its simplicity and efficiency. Although conventional LP models require precise data, managers and decision makers dealing with real-world optimization problems often do not have access to exact values. Fuzzy sets have been used in the fuzzy LP (FLP) problems to deal with the imprecise data in the decision variables, objective function and/or the constraints. The imprecisions in the FLP problems could be related to (1) the decision variables; (2) the coefficients of the decision variables in the objective function; (3) the coefficients of the decision variables in the constraints; (4) the right-hand-side of the constraints; or (5) all of these parameters. In this paper, we develop a new stepwise FLP model where fuzzy numbers are considered for the coefficients of the decision variables in the objective function, the coefficients of the decision variables in the constraints and the right-hand-side of the constraints. In the first step, we use the possibility and necessity relations for fuzzy constraints without considering the fuzzy objective function. In the subsequent step, we extend our method to the fuzzy objective function. We use two numerical examples from the FLP literature for comparison purposes and to demonstrate the applicability of the proposed method and the computational efficiency of the procedures and algorithms. © 2013-IOS Press and the authors. All rights reserved.

Aggregation and consensus for preference relations based on fuzzy partial orders

We propose a framework for eliciting and aggregating pairwise preference relations based on the assumption of an underlying fuzzy partial order. We also propose some linear programming optimization methods for ensuring consistency either as part of the aggregation phase or as a pre- or post-processing task. We contend that this framework of pairwise-preference relations, based on the Kemeny distance, can be less sensitive to extreme or biased opinions and is also less complex to elicit from experts. We provide some examples and outline their relevant properties and associated concepts.

Uso de neuro-fuzzy na avaliação da suscetibilidade de escorregamento de taludes.

A Presente dissertação apresenta uma aplicação de Inteligência Computacional na área de Geotecnia, com a utilização da Técnica de Neuro-Fuzzy para indicar a suscetibilidade de escorregamento de taludes no município do Rio de Janeiro, a partir de inspeção visual. Neste trabalho, a suscetibilidade corresponde à possibilidade de ocorrência de escorregamento sem considerar os danos relacionados ao evento. Adotou-se como variável de saída a Previsão de Escorregamento (PE) com três adjetivos que correspondem a Suscetibilidades Alta, Média e Baixa. A metodologia utilizada consistiu em, inicialmente, montar um banco de dados com informações preliminares de análise de estabilidade, com a indicação dos condicionantes de escorregamento relacionados à geomorfologia, pluviosidade, capacidade de drenagem, vegetação e ocupação com seus respectivos graus de suscetibilidades de escorregamento obtidos em um conjunto de Laudos de Vistoria da Geo Rio. O banco de dados foi aplicado em um algoritmo de Neuro-Fuzzy. Diversos testes foram realizados com as alterações dos parâmetros do modelo Neuro-Fuzzy para uma combinação de fatores condicionantes de escorregamento e refinamento do banco de dados. Os testes apresentaram diminuição do erro fornecido pelo programa com o aumento de tipos de condicionantes utilizados no treinamento, o que permite inferir que o escorregamento ocorre por uma complexa relação entre diversos fatores condicionantes. O banco de dados utilizado nos testes apresenta descontinuidades nas relações entre os diversos condicionantes, ou seja, para uma mesma faixa de valores de Altura do talude, não é possível obter uma relação para todas as faixas de outro condicionante e, até mesmo, para todas as faixas da Previsão de Escorregamento. As PEs obtidas na validação do modelo tiveram seus valores próximos aos desejados somente nos conjuntos de variáveis utilizadas para o treinamento. O modelo não foi capaz de apresentar valores de suscetibilidades dentro da faixa de valores utilizados no treinamento para combinação de variáveis com pequenos ruídos, o que indica a necessidade de ampliação do banco de dados tanto quantitativamente quanto qualitativamente de modo a cobrir as descontinuidades apresentadas nas relações entre as variáveis.

Distinguished algebraic semantics for t-norm based fuzzy logics:Methods and algebraic equivalencies

This paper is a contribution to Mathematical fuzzy logic, in particular to the algebraic study of t-norm based fuzzy logics. In the general framework of propositional core and ?-core fuzzy logics we consider three properties of completeness with respect to any semantics of linearly ordered algebras. Useful algebraic characterizations of these completeness properties are obtained and their relations are studied. Moreover, we concentrate on five kinds of distinguished semantics for these logics-namely the class of algebras defined over the real unit interval, the rational unit interval, the hyperreals (all ultrapowers of the real unit interval), the strict hyperreals (only ultrapowers giving a proper extension of the real unit interval) and finite chains, respectively-and we survey the known completeness methods and results for prominent logics. We also obtain new interesting relations between the real, rational and (strict) hyperreal semantics, and good characterizations for the completeness with respect to the semantics of finite chains. Finally, all completeness properties and distinguished semantics are also considered for the first-order versions of the logics where a number of new results are proved. © 2009 Elsevier B.V. All rights reserved.

L-Fuzzy Structured Query Language

Lattice valued fuzziness is more general than crispness or fuzziness based on the unit interval. In this work, we present a query language for a lattice based fuzzy database. We define a Lattice Fuzzy Structured Query Language (LFSQL) taking its membership values from an arbitrary lattice L. LFSQL can handle, manage and represent crisp values, linear ordered membership degrees and also allows membership degrees from lattices with non-comparable values. This gives richer membership degrees, and hence makes LFSQL more flexible than FSQL or SQL. In order to handle vagueness or imprecise information, every entry into an L-fuzzy database is an L-fuzzy set instead of crisp values. All of this makes LFSQL an ideal query language to handle imprecise data where some factors are non-comparable. After defining the syntax of the language formally, we provide its semantics using L-fuzzy sets and relations. The semantics can be used in future work to investigate concepts such as functional dependencies. Last but not least, we present a parser for LFSQL implemented in Haskell.

Fuzzy Topological Games and Related Topics

The main purpose of study is to extend the concept of the topological game G(K, X) and some other kinds of games into fuzzy topological games and to obtain some results regarding them. Owing to the fact that topological games have plenty of applications in covering properties, it made an attempt to explore some inter relations of games and covering properties in fuzzy topological spaces. Even though the main focus is on fuzzy para-meta compact spaces and closure preserving shading families, some brief sketches regarding fuzzy P-spaces and Shading Dimension is also provided. In a topological game players choose some objects related to the topological structure of a space such as points, closed subsets, open covers etc. More over the condition on a play to be winning for a player may also include topological notions such as closure, convergence, etc. It turns out that topological games are related to the Baire property, Baire spaces, Completeness properties, Convergence properties, Separation properties, Covering and Base properties, Continuous images, Suslin sets, Singular spaces etc.

Box Products in Fuzzy Topological Spaces and Related Topics

The topology as the product set with a base chosen as all products of open sets in the individual spaces. This topology is known as box topology. The main objective of this study is to extend the concept of box products to fuzzy box products and to obtain some results regarding them. Owing to the fact that box products have plenty of applications in uniform and covering properties, here made an attempt to explore some inter relations of fuzzy uniform properties and fuzzy covering properties in fuzzy box products. Even though the main focus is on fuzzy box products, some brief sketches regarding hereditarily fuzzy normal spaces and fuzzy nabla product is also provided. The main results obtained include characterization of fuzzy Hausdroffness and fuzzy regularity of box products of fuzzy topological spaces. The investigation of the completeness of fuzzy uniformities in fuzzy box products proved that a fuzzy box product of spaces is fuzzy topologically complete if each co-ordinate space is fuzzy topologically complete. The thesis also prove that the fuzzy box product of a family of fuzzy α-paracompact spaces is fuzzy topologically complete. In Fuzzy box product of hereditarily fuzzy normal spaces, the main result obtained is that if a fuzzy box product of spaces is hereditarily fuzzy normal ,then every countable subset of it is fuzzy closed. It also deals with the notion of fuzzy nabla product of spaces which is a quotient of fuzzy box product. Here the study deals the relation connecting fuzzy box product and fuzzy nabla product

Fuzzy concepts and formal methods

It has been recognised that formal methods are useful as a modelling tool in requirements engineering. Specification languages such as Z permit the precise and unambiguous modelling of system properties and behaviour. However some system problems, particularly those drawn from the information systems problem domain, may be difficult to model in crisp or precise terms. It may also be desirable that formal modelling should commence as early as possible, even when our understanding of parts of the problem domain is only approximate. This thesis suggests fuzzy set theory as a possible representation scheme for this imprecision or approximation. A fuzzy logic toolkit that defines the operators, measures and modifiers necessary for the manipulation of fuzzy sets and relations is developed. The toolkit contains a detailed set of laws that demonstrate the properties of the definitions when applied to partial set membership. It also provides a set of laws that establishes an isomorphism between the toolkit notation and that of conventional Z when applied to boolean sets and relations. The thesis also illustrates how the fuzzy logic toolkit can be applied in the problem domains of interest. Several examples are presented and discussed including the representation of imprecise concepts as fuzzy sets and relations, system requirements as a series of linguistically quantified propositions, the modelling of conflict and agreement in terms of fuzzy sets and the partial specification of a fuzzy expert system. The thesis concludes with a consideration of potential areas for future research arising from the work presented here.

Computing the numerical scale of the linguistic term set for the 2-tuple fuzzy linguistic representation model

When using linguistic approaches to solve decision problems, we need the techniques for computing with words (CW). Together with the 2-tuple fuzzy linguistic representation models (i.e., the Herrera and Mart´ınez model and the Wang and Hao model), some computational techniques for CW are also developed. In this paper, we define the concept of numerical scale and extend the 2-tuple fuzzy linguistic representation models under the numerical scale.We find that the key of computational techniques
based on linguistic 2-tuples is to set suitable numerical scale with
the purpose of making transformations between linguistic 2-tuples
and numerical values. By defining the concept of the transitive
calibration matrix and its consistent index, this paper develops an optimization model to compute the numerical scale of the linguistic term set. The desired properties of the optimization model are also presented. Furthermore, we discuss how to construct the transitive calibration matrix for decision problems using linguistic preference relations and analyze the linkage between the consistent index of the transitive calibration matrix and one of the linguistic preference relations. The results in this paper are pretty helpful to complete the fuzzy 2-tuple representation models for CW.

Strong fuzzy subsethood measures and strong equalities via implication functions

In this work we present the definition of strong fuzzy subsethood measure as a unifiying concept for the different notions of fuzzy subsethood that can be found in the literature. We analyze the relations of our new concept with the definitions by Kitainik ( [20]), Young ( [26]) and Sinha and Dougherty ( [23]) and we prove that the most relevant properties of the latter are preserved. We show also several construction methods. © 2014 Old City Publishing, Inc.

Lógica BDI fuzzy

Intendding to understand how the human mind operates, some philosophers and psycologists began to study about rationality. Theories were built from those studies and nowadays that interest have been extended to many other areas such as computing engineering and computing science, but with a minimal distinction at its goal: to understand the mind operational proccess and apply it on agents modelling to become possible the implementation (of softwares or hardwares) with the agent-oriented paradigm where agents are able to deliberate their own plans of actions. In computing science, the sub-area of multiagents systems has progressed using several works concerning artificial intelligence, computational logic, distributed systems, games theory and even philosophy and psycology. This present work hopes to show how it can be get a logical formalisation extention of a rational agents architecture model called BDI (based in a philosophic Bratman s Theory) in which agents are capable to deliberate actions from its beliefs, desires and intentions. The formalisation of this model is called BDI logic and it is a modal logic (in general it is a branching time logic) with three access relations: B, D and I. And here, it will show two possible extentions that tranform BDI logic in a modal-fuzzy logic where the formulae and the access relations can be evaluated by values from the interval [0,1]

Reducing the conservatism of LMI-based stabilisation conditions for TS fuzzy systems using fuzzy Lyapunov functions

In this article, the fuzzy Lyapunov function approach is considered for stabilising continuous-time Takagi-Sugeno fuzzy systems. Previous linear matrix inequality (LMI) stability conditions are relaxed by exploring further the properties of the time derivatives of premise membership functions and by introducing slack LMI variables into the problem formulation. The relaxation conditions given can also be used with a class of fuzzy Lyapunov functions which also depends on the membership function first-order time-derivative. The stability results are thus extended to systems with large number of rules under membership function order relations and used to design parallel-distributed compensation (PDC) fuzzy controllers which are also solved in terms of LMIs. Numerical examples illustrate the efficiency of the new stabilising conditions presented. © 2013 Copyright Taylor and Francis Group, LLC.

Modeling and measuring the spatial relation "along": Regions, contours and fuzzy sets

The analysis of spatial relations among objects in an image is an important vision problem that involves both shape analysis and structural pattern recognition. In this paper, we propose a new approach to characterize the spatial relation along, an important feature of spatial configurations in space that has been overlooked in the literature up to now. We propose a mathematical definition of the degree to which an object A is along an object B, based on the region between A and B and a degree of elongatedness of this region. In order to better fit the perceptual meaning of the relation, distance information is included as well. In order to cover a more wide range of potential applications, both the crisp and fuzzy cases are considered. In the crisp case, the objects are represented in terms of 2D regions or ID contours, and the definition of the alongness between them is derived from a visibility notion and from the region between the objects. However, the computational complexity of this approach leads us to the proposition of a new model to calculate the between region using the convex hull of the contours. On the fuzzy side, the region-based approach is extended. Experimental results obtained using synthetic shapes and brain structures in medical imaging corroborate the proposed model and the derived measures of alongness, thus showing that they agree with the common sense. (C) 2011 Elsevier Ltd. All rights reserved.

Fuzzy Web Knowledge Aggregation, Representation, and Reasoning for Online Privacy and Reputation Management

A social Semantic Web empowers its users to have access to collective Web knowledge in a simple manner, and for that reason, controlling online privacy and reputation becomes increasingly important, and must be taken seriously. This chapter presents Fuzzy Cognitive Maps (FCM) as a vehicle for Web knowledge aggregation, representation, and reasoning. With this in mind, a conceptual framework for Web knowledge aggregation, representation, and reasoning is introduced along with a use case, in which the importance of investigative searching for online privacy and reputation is highlighted. Thereby it is demonstrated how a user can establish a positive online presence.