✦ LIBER ✦

Uncertain fuzzy values still in the framework of first-order logic

✍ Scribed by O. Pons; J. C. Cubero; A. Gonzalez; M. A. Vila

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 106 KB
Volume: 17
Category: Article
ISSN: 0884-8173
DOI: 10.1002/int.10068

No coin nor oath required. For personal study only.

✦ Synopsis

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 uncertain fuzzy databases, considering that the fuzzy values stored in the database have a certainty value attached. Because it is still possible we are still in the framework of first-order logic, a transformation function on uncertain fuzzy values is introduced. The idea is to transform uncertainty into imprecision in such a way that an uncertain fuzzy value is transformed into a more imprecise but certain fuzzy value. With this transformation, all the original uncertain fuzzy values become true, and truth levels are not needed.

📜 SIMILAR VOLUMES

On the possibility of using complex valu

On the possibility of using complex values in fuzzy logic for representing inconsistencies

✍ Hung T. Nguyen; Vladik Kreinovich; Valery Shekhter 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB 👁 1 views

In science and engineering, there are ''paradoxical'' cases in which we have some Ž arguments in favor of some statement A so the degree to which A is known to be true is Ž . . positive nonzero , and we have some arguments in favor of its negation ! A, and we do not have enough information to tell w

On the consistency of rule bases based o

On the consistency of rule bases based on lattice-valued first-order logic LF(X)

✍ Yang Xu; Jun Liu; Da Ruan; Tsu-Tian Lee 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

The consistency of a rule base is an essential issue for rule-based intelligent information processing. Due to the uncertainty inevitably included in the rule base, it is necessary to verify the consistency of the rule base while investigating, designing, and applying a rule-based intelligent system

Logical frameworks, Aristotle and soft s

Logical frameworks, Aristotle and soft systems: a note on the origins, values and uses of logical frameworks, in reply to Gasper

✍ Simon Bell 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 57 KB 👁 2 views

The quantifier complexity of polynomial-

The quantifier complexity of polynomial-size iterated definitions in first-order logic

✍ Samuel R. Buss; Alan S. Johnson 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB

## Abstract We refine the constructions of Ferrante‐Rackoff and Solovay on iterated definitions in first‐order logic and their expressibility with polynomial size formulas. These constructions introduce additional quantifiers; however, we show that these extra quantifiers range over only finite set