We present a framework of L-fuzzy modifiers for L being a complete lattice. They are used to model linguistic hedges that act on linguistic terms represented by L-fuzzy sets. In the modelling process the context is taken into account by means of L-fuzzy relations, endowing the L-fuzzy modifiers with a clear inherent semantics. To our knowledge, these L-fuzzy modifiers are the first ones propose...

The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (Rl-monoids) are common generalizations of BL-algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain i...

Fuzzy description logics (DLs) serve as a tool to handle vagueness in real-world knowledge. There is particular interest in logics implementing Łukasiewicz semantics, which has a number of favourable properties. Current decision procedures for Łukasiewicz fuzzy DLs work by reduction to exponentially large mixed integer programming problems. Here, we present a decision method that stays closer t...

Closure operators (and closure systems) play a significant role in both pure and applied mathematics. In the framework of fuzzy set theory, several particular examples of closure operators and systems have been considered (e.g. so-called fuzzy subalgebras, fuzzy congruences, fuzzy topology etc.). Recently, fuzzy closure operators and fuzzy closure systems themselves (i.e. operators which map fu...

Fuzzy logic based methods have been widely used in linguistic modeling [6]. Here we use a different framework of random set to interpret imprecise concepts. This framework is referred to as label semantics [8]. Within this framework, fuzzy concepts are modeled by quantifying the subjective uncertainty associated with whether or not a label expression is appropriate to describe a particular valu...

In the paper we introduce logical calculi for representation of propositions with modal operators indexed by fuzzy values. There calculi are called Heyting-valued modal logics. We introduce the concept of a Heyting-valued Kripke model and consider a semantics of Heyting-valued modal logics at the class of Heyting-valued Kripke models.

This paper describes a natural language processing system implemented at Hewlett-Packard's Computer Research Center. The system's main components are: a Generalized Phrase Structure Grammar (GPSG); a top-down parser; a logic t ransducer that outputs a f i r s t o rde r logical representat ion; and a "disambiguator" that uses sortal information to convert "normal-form" f i r s t o rde r logical ...