Results 151 to 160 of about 74,540 (198)

Categorical study for algebras of Fitting’s lattice-valued logic and lattice-valued modal logic

Annals of Mathematics and Artificial Intelligence, 2020
The paper explores categorical interconnections between lattice-valued relational systems and algebras of Fitting’s lattice-valued modal logic. We define lattice-valued Boolean systems, and then we study adjointness and co-adjointness of functors defined on them. As a result, we get a duality for algebras of lattice-valued logic. Following this duality
Litan Kumar Das, Kumar S. Ray
openaire   +2 more sources

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.
Liu Yunfeng, Pan Chensheng, Cui Minfeng
openaire   +2 more sources

Algebraic Study of Lattice-Valued Logic and Lattice-Valued Modal Logic [PDF]

, 2008
In this paper, we study lattice-valued logic and lattice-valued modal logic from an algebraic viewpoint. First, we give an algebraic axiomatization of L -valued logic for a finite distributive lattice L . Then we define the notion of prime L -filters and prove an L -valued version of prime filter theorem for Boolean algebras, by which we show a Stone ...
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. >
Jia Hai, Huang Guo Jun
openaire   +2 more sources

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
Yang Xu, Xuefang Wang, Ke-Yun Qin, Ming Qing   +3 more
openaire   +2 more sources

Coding tree languages based on lattice-valued logic [PDF]

Soft Computing, 2016
We consider tree automata based on complete residuated lattice-valued (for simplicity we write L-valued) logic. First, we define the concepts of response function and accessible states (with threshold c) of an L-valued tree automaton. Thereafter, we consider coding of trees and investigate the relation between response function on trees and their ...
Maryam Ghorani, Mohammad Mehdi Zahedi
openaire   +1 more source

Lattice-valued logic, intelligent mathematics and their applications [PDF]

Proceedings. The Nineteenth International Symposium on Multiple-Valued Logic, 2003
The author defines lattice-valued set and lattice-valued reasoning strictly. Lattice-valued relation theory is also established. The author discusses their application to pattern recognition and expert systems. >
openaire   +1 more source

α — 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 ...
Yang Xu, Jiafeng Zhang
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.
Yang Xu, Jun Liu, Xingxing He
openaire   +2 more sources

Lattice-valued modal propositional logic and its completeness

Science China Information Sciences, 2010
Based on the concept of the complete lattice satisfying the first and second infinite distributive laws, the present paper introduces the semantics of the lattice-valued modal propositional logic. It is pointed out that this semantics generalizes the semantics of both classical modal propositional logic and [0, 1]-valued modal propositional logic.
HuiXian Shi, GuoJun Wang
openaire   +2 more sources