Results 171 to 180 of about 1,395,634 (216)
Fuzzifying topology based on complete residuated lattice-valued logic (I)
Using the semantical method of continuous-valued logic, the author establishes an elementary fuzzifying topology which is dual to the existing fuzzy topology. In the paper under review the author works in more general logic -- general complete residuated latticed valued logic - - and builds a so-called \(L\)-fuzzifying topology.
Ying, M
openaire +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
resolution method for a lattice-valued first-order logic
Engineering Applications of Artificial Intelligence, 2011exaly +2 more sources
Lattice-valued logic and lattice-valued information theory
Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic, 2003Lattice-valued information theory (LVIT) addresses the information representation of random events and fuzzy events. It is based on lattice-valued set theory and latticed-valued logic and provides a base for the practical application of multiple-valued logic.
null Pan Chensheng +2 more
openaire +1 more source
Lattice-valued logic and neural networks
1997 Annual Meeting of the North American Fuzzy Information Processing Society - NAFIPS (Cat. No.97TH8297), 2002Lattice-valued logic is a generalized logic whose definition function is set-valued. It can be applied to switching systems by defining a lattice-valued switch (LVS) whose parallel connection "/spl cup/" and cascade connection "/spl cap/" are generalized operators which may correspond respectively to the "max" (v) and "min" (/spl and/) operators in ...
null Yunfeng Liu, P.K.C. Wang
openaire +1 more source
Lattice valued pair-lattice valued logic theory and its applications to AI
Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic, 2003Lattice-valued pairs and lattice-valued pair statements are defined. Ordered pairs are used to portray the strength of rules, and suitable renewal formulas are given. Lattice-valued pairs and logic theory provide a new tool for imprecise inference. >
null Huang Guo Jun, null Jia Hai
openaire +1 more source
α — Semantic resolution method in lattice-valued logic
2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), 2011Resolution-based automated reasoning is one of most important research directions in AI, semantic method is one of the most important reform methods for resolution principle, in semantic resolution method, it utilize the technology that restraining the type of clauses and the order of literals participated in resolution procedure to reduce the ...
Jiafeng Zhang, Yang Xu 0001
openaire +1 more source
Alpha-Lock Paramodulation for Lattice-Valued Propositional Logic
2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE), 2015Aiming to improve the efficiency of alpha-paramodulation in lattice-valued logic with equality, this paper focuses on alpha-lock paramodulation for lattice-valued logic, which can more efficiently handle the lattice-valued logical formula with equality.
Xingxing He, Yang Xu 0001, Jun Liu 0001
openaire +2 more sources
Lattice-Valued Propositional Logics
2003In Chapter 2, a logical algebra — lattice implication algebra has been established, and its properties have been discussed in Chapters 2 – 8. In this chapter, we establish lattice-valued propositional logic LP(X)and gradational lattice-valued propositional logic Lvpl based on lattice implication algebra.
Yang Xu, Keyun Qin, Da Ruan, Jun Liu
openaire +1 more source
Syntax theory of finite lattice-valued propositional logic
Science China Information Sciences, 2012In this paper, we establish the graded syntax theory of lattice-valued propositional logic based on finite lattice implication algebras, define the notions of syntactic consequence operation and formal proof, and develop a kind of graded finite lattice-valued propositional calculus.
Xiaodong Pan, Dan Meng, Yang Xu 0001
openaire +2 more sources

