Fuzzy situational inference for expert systems with fuzzy logic
Interpolative fuzzy algorithms for intelligent controllers and decision making
Knowledge-based mobile agents.
Logical Aggregation Based on Interpolative Boolean Algebra.
Logique combinatoire et linguistique : grammaire catégorielle combinatoire applicative
La Grammaire Catégorielle Combinatoire Applicative étend la Grammaire Catégorielle Combinatoire de Steedman par une association canonique entre les règles et des combinateurs de Curry d'une part et l'utilisation de métarègles qui contrôlent les opérations de changement de type d'autre part. Ce modèle est inclus dans le modèle général de la Grammaire Applicative et Cognitive (Desclés) avec trois niveaux de représentation : (i) le phénotype (expressions concaténées) ; (ii) le génotype (expressions...
Mixed integer programming, general concept inclusions and fuzzy description logics.
On (anti) conditional independence in Dempster-Shafer theory.
This paper verifies a result of [9] concerning graphoidal structure of Shenoy's notion of independence for Dempster-Shafer theory belief functions. Shenoy proved that his notion of independence has graphoidal properties for positive normal valuations. The requirement of strict positive normal valuations as prerequisite for application of graphoidal properties excludes a wide class of DS belief functions. It excludes especially so-called probabilistic belief functions. It is demonstrated that the...
On one NP-complete problem
On some properties of grounding nonuniform sets of modal conjunctions
A language grounding problem is considered for nonuniform sets of modal conjunctions consisting of conjunctions extended with more than one modal operator of knowledge, belief or possibility. The grounding is considered in the context of semiotic triangles built from language symbols, communicative cognitive agents and external objects. The communicative cognitive agents are assumed to be able to observe external worlds and store the results of observations in internal knowledge bases. It is assumed...
On some properties of -planes of type-2 fuzzy sets
Some basic properties of -planes of type-2 fuzzy sets are investigated and discussed in connection with the similar properties of -cuts of type-1 fuzzy sets. It is known, that standard intersection and standard union of type-1 fuzzy sets (it means intersection and union under minimum t-norm and maximum t-conorm, respectively) are the only cutworthy operations for type-1 fuzzy sets. Recently, a similar property was declared to be true also for -planes of type-2 fuzzy sets in a few papers. Thus,...
On the viability of an algebraic approach to non-monotonic reasoning.
Operating on formal concept abstraction.
The subject of this paper regards a procedure to obtain the abstract form of concepts, directly from their most natural form, thus these can be efficiently learned and the possibility of operating formally on them is reached. The achievement of said type of form results also useful to compute conceptual parameters symbolic and numerical in nature.
Probability Logics
(Pure) logic out of probability.
Today, Logic and Probability are mostly seen as independent fields with a separate history and set of foundations. Against this dominating perception, only a very few people (Laplace, Boole, Peirce) have suspected there was some affinity or relation between them. The truth is they have a considerable common ground which underlies the historical foundation of both disciplines and, in this century, has prompted notable thinkers as Reichenbach [14], Carnap [2] [3] or Popper [12] [13] (and Gaifman [5],...
Qualitative reasoning in Bayesian networks.
Some probabilistic inference rules which can be compared with the inference rules of preferential logic are given and it will be shown how they work in graphical models, allowing qualitative plausible reasoning in Bayesian networks.
Reasoning in Basic Description Logics and Description Logics with Modal Operators
Refinements of inductive inference by Popperian and reliable machines
Rough membership functions: a tool for reasoning with uncertainty
A variety of numerical approaches for reasoning with uncertainty have been investigated in the literature. We propose rough membership functions, rm-functions for short, as a basis for such reasoning. These functions have values in the interval [0,1] and are computable on the basis of the observable information about the objects rather than on the objects themselves. We investigate properties of the rm-functions. In particular, we show that our approach is intensional with respect to the class of...
Short Note: Counting Conjectures.
Similarity in fuzzy reasoning.
Fuzzy set theory is based on a `fuzzification' of the predicate in (element of), the concept of membership degrees is considered as fundamental. In this paper we elucidate the connection between indistinguishability modelled by fuzzy equivalence relations and fuzzy sets. We show that the indistinguishability inherent to fuzzy sets can be computed and that this indistinguishability cannot be overcome in approximate reasoning. For our investigations we generalize from the unit interval as the basis...