𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fuzzy unification and first order probabilistic logic

✍ Scribed by Marco Piastra

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
123 KB
Volume
17
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

✦ Synopsis

The notion of unification for fuzzy sets in fuzzy logic programming is explored in this article from the standpoint of a theoretical framework based on first-order probabilistic modal logic. The fundamental difference between the latter perspective and other approaches described in the literature lies in the characterization of fuzzy sets, which are construed in the logical framework as derived entities having a probabilistic deep structure. The analysis reveals that a few semantic unification techniques are sound even in this probabilistic approach, provided that some specific conditions are enforced. In addition, the approach helps to clarify some important aspects of the informal interpretation for the unification process, including a rationale for the applicability requisites of computational techniques.

In the discussion, the reference model adopted for the notion of fuzzy unification is that of evidential logic programming, that is, the one underlying the programming language FRIL. 5

πŸ“œ SIMILAR VOLUMES

Uncertain fuzzy values still in the fram
Uncertain fuzzy values still in the framework of first-order logic
✍ O. Pons; J. C. Cubero; A. Gonzalez; M. A. Vila πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 106 KB πŸ‘ 2 views

In this article, we first summarize the more important aspects of a fuzzy logic relational database and show how a fuzzy relational database can be represented and handled using first-order logic. Given that the results obtained for fuzzy databases are satisfactory, we then tackle the problem of unc

Sperner spaces and first-order logic
Sperner spaces and first-order logic
✍ Andreas Blass; Victor Pambuccian πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 79 KB

## Abstract We study the class of Sperner spaces, a generalized version of affine spaces, as defined in the language of pointline incidence and line parallelity. We show that, although the class of Sperner spaces is a pseudo‐elementary class, it is not elementary nor even ℒ︁~∞__Ο‰__~‐axiomatizable.

Characterizing Second Order Logic with F
Characterizing Second Order Logic with First Order Quantifiers
✍ David Harel πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 257 KB

CHARACTERIZING SECOND ORDER LOGIC WITH FIRST ORDER QU-4NTIFIERX by DAVID HAREL in Cambridge, Massachusets (U.S.A.) l) ') The author is indebted to W. J. WALKOE, A. R. MEYER, A. SHAMIR and a rcfeiee for comments on previous versions.

Towards an automated deduction system fo
Towards an automated deduction system for first-order possibilistic logic programming with fuzzy constants
✍ Teresa Alsinet; LluΓ­s Godo πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 245 KB

In this article, we present a first-order logic programming language for fuzzy reasoning under possibilistic uncertainty and poorly known information. Formulas are represented by a pair (Ο•, Ξ±), in which Ο• is a first-order Horn clause or a query with fuzzy constants and regular predicates, and Ξ± ∈ [0

Universal First-Order Definability in Mo
Universal First-Order Definability in Modal Logic
✍ R. E. Jennings; D. K. Johnston; P. K. Schotch πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 198 KB

UPiIVERSAL FIRST-ORDER DEFINABILITY I N MODAL LOGIC by R. E. JENNIXGS and D. K. JOHNSTON in Burnaby, British Columbia (Canada) and P. K. SCHOTCH in Halifax, Nova Scotia (Canada)l) In [ l ] R. I. GOLDBLATT presents a model theoretic characterization of the class of modal sentences determined by firs