Results 201 to 210 of about 174,060 (272)

Lattice-valued logic and lattice-valued information theory

Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic, 2003
Lattice-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, null Cui Minfeng, null Liu Yunfeng   +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), 2002
Lattice-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

Tautologies in some lattice-valued logic systems

Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693), 2004
In this paper, the tautologies in some lattice-valued logic systems whose truth-values fields are lattices are formed by direct product of two lattice implication algebras, /spl alpha/-tautologies and F-tautologies are also discussed. As two examples, the tautologies in lattice-valued systems of L/sub 4/P (X) and L/sub 6/P (X) are discussed.
null Hai-Ming Li, null Ke-Yun Qin, null Yang Xu   +2 more
openaire   +1 more source

Closure operators in lattice-valued propositional logics

Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693), 2004
In this paper, first the relation between two lattice-valued logic systems based on lattice implication algebras, LP(X) and Lvpl, is discussed. And it shows that LP(X) is not a special case of Lvp, since the generalized modus ponens rule in LP(X) is not a rule in Lvpl. On the other hand, in most of non-classical logics, closure operators are defined by
null Xue-Fang Wang, null Ming Qing, null Yang Xu, null Ke-Yun Qin   +3 more
openaire   +1 more source

Lattice-Valued Propositional Logics

2003
In 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

Lattice valued pair-lattice valued logic theory and its applications to AI

Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic, 2003
Lattice-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

Lattice-valued modal propositional logic and its completeness

Science China Information Sciences, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shi, HuiXian, Wang, GuoJun
openaire   +2 more sources

α — Semantic resolution method in lattice-valued logic

2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), 2011
Resolution-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
openaire   +1 more source

Lattice-Valued First-Order Logics

2003
In Chapter 9, we discussed the lattice-valued propositional logics based on lattice implication algebra and their properties. In this chapter, we discuss the lattice-valued first-order logic based on lattice implication algebra. In Section 10.1, a lattice-valued first-order logic LF(X) is given. In Section 10.2, a gradational lattice-valued first-order
Yang Xu, Keyun Qin, Da Ruan, Jun Liu
openaire   +1 more source

Alpha-Lock Paramodulation for Lattice-Valued Propositional Logic

2015 10th International Conference on Intelligent Systems and Knowledge Engineering (ISKE), 2015
Aiming 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, Jun Liu
openaire   +1 more source