Related papers: Boolean and ortho fuzzy subset logics
The major part of this thesis deals with fuzzy geometric logic and fuzzy geometric logic with graded consequence. The first chapter mainly contains the concept of topological system introduced by S. Vickers in 1989. In Chapter 2 the notion…
The theory of fuzzy sets has a wide range of applications, one of which is that of fuzzy groups . The fuzzy sets were introduced by Zadeh. Even though, the story of fuzzy logic started much earlier, it was specially designed mathematically…
Linear representations for a subclass of boolean symmetric functions selected by a parity condition are shown to constitute a generalization of the linear constraints on probabilities introduced by Boole. These linear constraints are…
In this paper we establish a link between fuzzy and preferential semantics for description logics and Self-Organising Maps, which have been proposed as possible candidates to explain the psychological mechanisms underlying category…
The combination of higher-order theories and fuzzy logic can be useful in decision-making tasks that involve reasoning across abstract functions and predicates, where exact matches are often rare or unnecessary. Developing efficient…
This paper presents a unified differentiable boolean operator for implicit solid shape modeling using Constructive Solid Geometry (CSG). Traditional CSG relies on min, max operators to perform boolean operations on implicit shapes. But…
The treatment of complex systems often requires the manipulation of vague, imprecise and uncertain information. Indeed, the human being is competent in handling of such systems in a natural way. Instead of thinking in mathematical terms,…
There are two kinds of bisimulation, namely crisp and fuzzy, between fuzzy structures such as fuzzy automata, fuzzy labeled transition systems, fuzzy Kripke models and fuzzy interpretations in description logics. Fuzzy bisimulations between…
The rough-set theory proposed by Pawlak, has been widely used in dealing with data classification problems. The original rough-set model is, however, quite sensitive to noisy data. Tzung thus proposed deals with the problem of producing a…
LECTURE GIVEN AT TH2002. Given a set of Boolean variables, and some constraints between them, is it possible to find a configuration of the variables which satisfies all constraints? This problem, which is at the heart of combinatorial…
We establish a lower bound of $2^n$ conditional branches for deciding the satisfiability of the conjunction of any two Boolean formulas from a set called a full representation of Boolean functions of $n$ variables - a set containing a…
In this paper, we consider bounded width circuits and nondeterministic circuits in three somewhat new directions. In the first part of this paper, we mainly consider bounded width circuits. The main purpose of this part is to prove that…
We prove that the join of two sets may actually fall into a lower level of the extended low hierarchy than either of the sets. In particular, there exist sets that are not in the second level of the extended low hierarchy, EL_2, yet their…
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…
This paper considers the linear objective function optimization with respect to a more general class of bipolar fuzzy relational equations, where the fuzzy compositions are defined by an arbitrary continuous Archimedean t-norm. In addition,…
This work contributes to the domains of Boolean algebra and of Bayesian probability, by proposing an algebraic extension of Boolean algebras, which implements an operator for the Bayesian conditional inference and is closed under this…
Our research builds upon Halmos's foundational work on functional monadic Boolean algebras and our previous work on tense operators to develop three essential constructions, including the important concepts of fuzzy sets and powerset…
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:",…
The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…
This paper deals with conditions under which the quotient of $L$-fuzzy up-sets forms a complete lattice by using terminologies of closure operators. It first gives a condition that a family of some subsets of a nonempty set can be…