Results 1  10
of
22,913
Monadic Fuzzy Predicate Logics
"... Two variants of monadic fuzzy predicate logic are analyzed and compared with the full fuzzy predicate logic with respect to finite model property (properties) and arithmetical complexity of sets of tautologies, satisfiable formulas and of analogous notion restricted to finite models. 1 ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Two variants of monadic fuzzy predicate logic are analyzed and compared with the full fuzzy predicate logic with respect to finite model property (properties) and arithmetical complexity of sets of tautologies, satisfiable formulas and of analogous notion restricted to finite models. 1
Discovery of fuzzy predicates in database
"... Advanced technologies have enabled us to collect large amounts of data. These data may be transformed into useful knowledge. Because of our limited ability to manually process the data, it is necessary to use automatic tools to mine useful knowledge. Many datamining methods have been proposed whic ..."
Abstract
 Add to MetaCart
which are normally restricted to a given representation, such as rules and clusters. This paper proposes FuzzyPred, a metaheuristicsbased datamining method to obtain fuzzy predicates in normal form. We believe that the patterns obtained by FuzzyPred represent an interesting new representation
A System for Reasoning with Fuzzy Predicates
, 1994
"... Uncertainty is a multifaceted concept, and a system for automated reasoning with multiple representations of uncertainty was proposed in [CdSRH93]. In this work we base on that system and present an efficient language for reasoning with fuzzy predicates. The language in [CdSRH93] is developed as a P ..."
Abstract
 Add to MetaCart
Uncertainty is a multifaceted concept, and a system for automated reasoning with multiple representations of uncertainty was proposed in [CdSRH93]. In this work we base on that system and present an efficient language for reasoning with fuzzy predicates. The language in [CdSRH93] is developed as a
A Note on Fuzzy Predicate Logic
"... . Recent development of mathematical fuzzy logic is briefly surveyed. The set of all formulas of predicate logic that are tautologies with respect to all continuous tnorms is shown to be heavily nonrecursive (\Pi 2 hard). 1 Introduction Recently considerable progres has been made in strictly ma ..."
Abstract
 Add to MetaCart
. Recent development of mathematical fuzzy logic is briefly surveyed. The set of all formulas of predicate logic that are tautologies with respect to all continuous tnorms is shown to be heavily nonrecursive (\Pi 2 hard). 1 Introduction Recently considerable progres has been made in strictly
Omitting Types in Fuzzy Predicate Logics 1
, 2008
"... The paper is a contribution to the model theory of fuzzy logic in narrow sense. We focus on the classical omitting types theorem and generalize it for predicate fuzzy logics with traditional syntax. First we prove this theorem for MTL∀fuzzy predicate logic with countable language. Then we extend it ..."
Abstract
 Add to MetaCart
The paper is a contribution to the model theory of fuzzy logic in narrow sense. We focus on the classical omitting types theorem and generalize it for predicate fuzzy logics with traditional syntax. First we prove this theorem for MTL∀fuzzy predicate logic with countable language. Then we extend
Nonclausal Resolution in Fuzzy Predicate Logic with Evaluated Syntax background and implementation
"... The presentation deals with the refutational resolution theorem proving system for the Fuzzy Predicate Logic of FirstOrder (FPL) based on the general (nonclausal) resolution rule. It is based on the Fuzzy Predicate Logic with Evaluated Syntax. There is also presented an unification algorithm handl ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
The presentation deals with the refutational resolution theorem proving system for the Fuzzy Predicate Logic of FirstOrder (FPL) based on the general (nonclausal) resolution rule. It is based on the Fuzzy Predicate Logic with Evaluated Syntax. There is also presented an unification algorithm
IFSAEUSFLAT 2009 On Reduced Semantics for Fuzzy Predicate Logics
"... Abstract — Our work is a contribution to the modeltheoretic study of equalityfree fuzzy predicate logics. We present a reduced semantics and we prove a completeness theorem of the logics with respect to this semantics. The main concepts being studied are the Leibniz congruence and the relative rel ..."
Abstract
 Add to MetaCart
Abstract — Our work is a contribution to the modeltheoretic study of equalityfree fuzzy predicate logics. We present a reduced semantics and we prove a completeness theorem of the logics with respect to this semantics. The main concepts being studied are the Leibniz congruence and the relative
Verb Semantics And Lexical Selection
, 1994
"... ... structure. As Levin has addressed (Levin 1985), the decomposition of verbs is proposed for the purposes of accounting for systematic semanticsyntactic correspondences. This results in a series of problems for MT systems: inflexible verb sense definitions; difficulty in handling metaphor and new ..."
Abstract

Cited by 520 (4 self)
 Add to MetaCart
alternatives that can improve the handling of these problems? We suggest an alternative that represents verb semantic knowledge and accounts for not only finetuned systematic semanticsyntactic correspondences, but also semanticinterpretation correspondences. A verb is not represented by a predicate
The Theory of Hybrid Automata
, 1996
"... A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on pur ..."
Abstract

Cited by 680 (13 self)
 Add to MetaCart
A hybrid automaton is a formal model for a mixed discretecontinuous system. We classify hybrid automata acoording to what questions about their behavior can be answered algorithmically. The classification reveals structure on mixed discretecontinuous state spaces that was previously studied on purely discrete state spaces only. In particular, various classes of hybrid automata induce finitary trace equivalence (or similarity, or bisimilarity) relations on an uncountable state space, thus permitting the application of various modelchecking techniques that were originally developed for finitestate systems.
Results 1  10
of
22,913