Related papers: The Complexity of Fuzzy Logic
How can non-classical logic contribute to the analysis of complexity in computer science? In this paper, we give a step towards this question, taking a logical model-theoretic approach to the analysis of complexity in fuzzy constraint…
This paper considers the problem of building saturated models for first-order graded logics. We define types as pairs of sets of formulas in one free variable which express properties that an element is expected, respectively, to satisfy…
Classical logic has a serious limitation in that it cannot cope with the issues of vagueness and uncertainty into which fall most modes of human reasoning. In order to provide a foundation for human knowledge representation and reasoning in…
We propose a doxastic \L ukasiewicz logic \textbf{B\L} that is sound and complete with respect to the class of Kripke-based models in which atomic propositions and accessibility relations are both infinitely valued in the standard…
The first system of many-valued logic was introduced by J. Lukasiewicz, his motivation was of philosophical nature as he was looking for an interpretation of the concepts of possibility and necessity. Since then, plenty of research has been…
Fuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information. Several connectives are available to combine different…
We introduce a two-sort weighted modal logic for possibilistic reasoning with fuzzy formal contexts. The syntax of the logic includes two types of weighted modal operators corresponding to classical necessity ($\Box$) and sufficiency…
Justification logics are special kinds of modal logics which provide a framework for reasoning about epistemic justifications. For this, they extend classical boolean propositional logic by a family of necessity-style modal operators "t:",…
We present a logic for reasoning about graded inequalities which generalizes the ordinary inequational logic used in universal algebra. The logic deals with atomic predicate formulas of the form of inequalities between terms and formalizes…
Differentiable logics are a family of quantitative logics originated in the machine learning literature. Because of their origin, differentiable logics often come equipped with analytic properties that guarantee that they are…
We introduce the concept of quasi-coincidence of a fuzzy interval value with an interval valued fuzzy set. By using this new idea, we introduce the notions of interval valued $(\in,\ivq)$-fuzzy filters of pseudo $BL$-algebras and…
Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs using truth values from the interval [0,1] becomes undecidable…
In this paper, the formulation of Quantum Mechanics in terms of fuzzy logic and fuzzy sets is explored. A result by Pykacz, that establishes a correspondence between (quantum) logics (lattices with certain properties) and certain families…
Real-valued logics have seen a renewed interest in verification for probabilistic and quantitative systems, in particular machine learning models, where they can be used to directly integrate specifications in the training objective. To do…
In the paper we define the convergence of compact fuzzy sets as a convergence of alpha-cuts in the topology of compact subsets of a metric space. Furthermore we define typical convergences of fuzzy variables and show relations with…
The first contribution of this paper is the presentation of a Pavelka - like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (eg) and a new type of conjunction…
The concept of a fuzzy number is generalized to the case of a finite carrier set of partially ordered elements, more precisely, a lattice, when a membership function also takes values in a partially ordered set (a lattice). Zadeh's…
We propose a matrix model for two- and many-valued logic using families of observables in Hilbert space, the eigenvalues give the truth values of logical propositions where the atomic input proposition cases are represented by the…
One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…
Within the possibilistic approach to uncertainty modeling, the paper presents a modal logical system to reason about qualitative (comparative) statements of the possibility (and necessity) of fuzzy propositions. We relate this qualitative…