Fuzzy logic programs as hypergraphs. Termination results

Graph theory has been a useful tool for logic programming in many aspects. In this paper, we propose an equivalent representation of multi-adjoint logic programs using hypergraphs, which are a generalization of classical graphs that allows the use of hypergraph theory in logic programming. Specifically, this representation has been considered in this paper to increase the level and flexibility of different termination results of the computation of the least model of fuzzy logic programs via the immediate consequence operator. Consequently, the least model of more general and versatile fuzzy logic programs can be obtained after finitely many iterations, although infinite programs or programs with loops and general aggregators will be consideredAgencia Estatal de Investigación PID2019-108991GB-I00Junta de Andalucía FEDER-UCA18-108612European Union COST Action CA1712

FUZZY LOGIC AND COMPROMISE PROGRAMMING IN PORTFOLIO MANAGEMENT

The objective of this paper is to develop a portfolio optimization technique that is simple enough for an individual with little knowledge of economic theory to systematically determine his own optimized portfolio. A compromise programming approach and a fuzzy logic approach are developed as alternatives to the traditional EV model.Agricultural Finance,

Reducing fuzzy answer set programming to model finding in fuzzy logics

In recent years, answer set programming (ASP) has been extended to deal with multivalued predicates. The resulting formalisms allow for the modeling of continuous problems as elegantly as ASP allows for the modeling of discrete problems, by combining the stable model semantics underlying ASP with fuzzy logics. However, contrary to the case of classical ASP where many efficient solvers have been constructed, to date there is no efficient fuzzy ASP solver. A well-known technique for classical ASP consists of translating an ASP program P to a propositional theory whose models exactly correspond to the answer sets of P. In this paper, we show how this idea can be extended to fuzzy ASP, paving the way to implement efficient fuzzy ASP solvers that can take advantage of existing fuzzy logic reasoners

MATHEMATICAL MODEL FOR INVENTORY CONTROL PROBLEM USING IMPRECISE PARAMETERS

In this paper, an inventory control problem is discussed using imprecise parameters. The fusion of geometric programming and fuzzy logic is used as imprecise parameters to solve inventory control problems. In inventory, holding costs, set-up costs, etc. may be flexible due to vague information. Fuzzy set theory is used to convert the inventory model crisp to fuzzy for producing flexible output. Compensatory operator is used to aggregate the fuzzy membership functions corresponding to fuzzy sets for fuzzy objectives and constraints. This aggregation gives the overall achievement function and the model known as fuzzy geometric programming model. &nbsp

Fuzzy logic controlled miniature LEGO robot for undergraduate training system

Fuzzy logic enables designers to control complex systems more effectively than traditional approaches as it provides a simple way to arrive at a definite conclusion upon ambiguous, imprecise or noisy information. In this paper, we describe the development of two miniature LEGO robots, which are the line following and the light searching mobile robots to provide a better understanding of fuzzy logic control theory and real life application for an undergraduate training system. This study is divided into two parts. In the first part, an object sorter robot is built to perform pick and place task to load different colour objects on a fuzzy logic controlled line following robot which then carries the preloaded objects to a goal by following a white line. In the second part, an intelligent fuzzy logic controlled light searching robot with the capability to navigate in a maze is developed. All of the robots are constructed by using the LEGO Mindstorms kit. Interactive C programming language is used to program fuzzy logic robots. Experimental results show that the robots has successfully track the predefined path and navigate towards light source under the influence of the fuzzy logic controller; and therefore can be used as a training system in undergraduate fuzzy logic class

A logic programming framework for possibilistic argumentation: formalization and logical properties

In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most of such frameworks, however, are unable to deal with explicit uncertainty, nor with vague knowledge, as defeasibility is directly encoded in the object language. This paper presents Possibilistic Logic Programming (P-DeLP), a new logic programming language which combines features from argumentation theory and logic programming, incorporating as well the treatment of possibilistic uncertainty. Such features are formalized on the basis of PGL, a possibilistic logic based on G¨odel fuzzy logic. One of the applications of P-DeLP is providing an intelligent agent with non-monotonic, argumentative inference capabilities. In this paper we also provide a better understanding of such capabilities by defining two non-monotonic operators which model the expansion of a given program P by adding new weighed facts associated with argument conclusions and warranted literals, respectively. Different logical properties for the proposed operators are studie

On the existence of free models in fuzzy universal Horn classes

This paper is a contribution to the study of the universal Horn fragment of predicate fuzzy logics, focusing on some relevant notions in logic programming. We introduce the notion of term structure associated to a set of formulas in the fuzzy context and we show the existence of free models in fuzzy universal Horn classes. We prove that every equality-free consistent universal Horn fuzzy theory has a Herbrand model