2,632 research outputs found
Resolution in Linguistic Propositional Logic based on Linear Symmetrical Hedge Algebra
The paper introduces a propositional linguistic logic that serves as the
basis for automated uncertain reasoning with linguistic information. First, we
build a linguistic logic system with truth value domain based on a linear
symmetrical hedge algebra. Then, we consider G\"{o}del's t-norm and t-conorm to
define the logical connectives for our logic. Next, we present a resolution
inference rule, in which two clauses having contradictory linguistic truth
values can be resolved. We also give the concept of reliability in order to
capture the approximative nature of the resolution inference rule. Finally, we
propose a resolution procedure with the maximal reliability.Comment: KSE 2013 conferenc
On the incorporation of interval-valued fuzzy sets into the Bousi-Prolog system: declarative semantics, implementation and applications
In this paper we analyse the benefits of incorporating interval-valued fuzzy
sets into the Bousi-Prolog system. A syntax, declarative semantics and im-
plementation for this extension is presented and formalised. We show, by using
potential applications, that fuzzy logic programming frameworks enhanced with
them can correctly work together with lexical resources and ontologies in order
to improve their capabilities for knowledge representation and reasoning
Incorporating the Basic Elements of a First-degree Fuzzy Logic and Certain Elments of Temporal Logic for Dynamic Management Applications
The approximate reasoning is perceived as a derivation of new formulas with the corresponding temporal attributes, within a fuzzy theory defined by the fuzzy set of special axioms. For dynamic management applications, the reasoning is evolutionary because of unexpected events which may change the state of the expert system. In this kind of situations it is necessary to elaborate certain mechanisms in order to maintain the coherence of the obtained conclusions, to figure out their degree of reliability and the time domain for which these are true. These last aspects stand as possible further directions of development at a basic logic level. The purpose of this paper is to characterise an extended fuzzy logic system with modal operators, attained by incorporating the basic elements of a first-degree fuzzy logic and certain elements of temporal logic.Dynamic Management Applications, Fuzzy Reasoning, Formalization, Time Restrictions, Modal Operators, Real-Time Expert Decision System (RTEDS)
General combination rules for qualitative and quantitative beliefs
Martin and Osswald \cite{Martin07} have recently proposed many
generalizations of combination rules on quantitative beliefs in order to manage
the conflict and to consider the specificity of the responses of the experts.
Since the experts express themselves usually in natural language with
linguistic labels, Smarandache and Dezert \cite{Li07} have introduced a
mathematical framework for dealing directly also with qualitative beliefs. In
this paper we recall some element of our previous works and propose the new
combination rules, developed for the fusion of both qualitative or quantitative
beliefs
Aggregated fuzzy answer set programming
Fuzzy Answer Set programming (FASP) is an extension of answer set programming (ASP), based on fuzzy logic. It allows to encode continuous optimization problems in the same concise manner as ASP allows to model combinatorial problems. As a result of its inherent continuity, rules in FASP may be satisfied or violated to certain degrees. Rather than insisting that all rules are fully satisfied, we may only require that they are satisfied partially, to the best extent possible. However, most approaches that feature partial rule satisfaction limit themselves to attaching predefined weights to rules, which is not sufficiently flexible for most real-life applications. In this paper, we develop an alternative, based on aggregator functions that specify which (combination of) rules are most important to satisfy. We extend upon previous work by allowing aggregator expressions to define partially ordered preferences, and by the use of a fixpoint semantics
- …