𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Negation functions based semantics for ordered linguistic labels

✍ Scribed by Vicenç Torra


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
812 KB
Volume
11
Category
Article
ISSN
0884-8173

No coin nor oath required. For personal study only.

✦ Synopsis


Mter arguing that in the knowledge acquisition framework experts cannot always supply a precise semantics for the linguistic labels they use, we show that negation functions over an ordered set of linguistics labels induce a semantics. We study the semantics induced by classical negation, functions from L to L, and also the one induced by negation functions from L to parts of L.


📜 SIMILAR VOLUMES


Aggregation of linguistic labels when se
✍ Vicenç Torra 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

In this work, we introduce aggregation operators for linguistic labels this is, ordinal . Ž . scales when different experts or information sources use different domains to express Ž . their knowledge. The aggregated value is computed i building first a unified framework, Ž . Ž . ii transforming all

TOPOS BASED SEMANTIC FOR CONSTRUCTIVE LO
✍ Barbara Klunder; B. Klunder 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 510 KB

## Abstract The aim of the paper is to show that topoi are useful in the categorial analysis of the constructive logic with strong negation. In any topos ϵ we can distinguish an object Λ and its truth‐arrows such that sets ϵ(__A__, Λ) (for any object __A__) have a Nelson algebra structure. The obje

Tuning the matching function for a thres
✍ E. Herrera-Viedma; A.G. López-Herrera; C. Porcel 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB

Information retrieval is an activity that attempts to produce documents that better fulfill user information needs. To achieve this activity an information retrieval system uses matching functions that specify the degree of relevance of a document with respect to a user query. Assuming linguistic-we

A fully abstract semantics for a higher-
✍ Alan Jeffrey 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 299 KB

This paper presents a functional programming language, based on Moggi's monadic metalanguage. In the ÿrst part of this paper, we show how the language can be regarded as a monad on a category of signatures, and that the resulting category of algebras is equivalent to the category of computationally

Order-based fitness functions for geneti
✍ Cristina López-Pujalte; Vicente P. Guerrero-Bote; Félix de Moya-Anegón 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB

## Abstract Recently there have been appearing new applications of genetic algorithms to information retrieval, most of them specifically to relevance feedback. The evolution of the possible solutions are guided by fitness functions that are designed as measures of the goodness of the solutions. Th