α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic
نویسندگان
چکیده
منابع مشابه
α-Resolution Method for Lattice-valued Horn Generalized Clauses in Lattice-valued Propositional Logic Systems
In this paper, an α-resolution method for a set of lattice-valued Horn generalized clauses is established in lattice-valued propositional logic systemL P(X) based on lattice implication algebra. Firstly, the notions of lattice-valued Horn generalized clause, normal lattice-valued Horn generalized clause and unit latticevalued Horn generalized clause are given in L P(X). Then, the α-resolution o...
متن کاملα-Quasi-Lock Semantic Resolution Method Based on Lattice-Valued Logic
Based on the general form of -resolution principle for a lattice-valued logic with truth-values defined in a latticevalued logical algebra structure lattice implication algebra, the further extended -resolution method in this lattice-valued logic is discussed in the present paper in order to increase the efficiency of the resolution method. Firstly, -quasi-lock semantic resolution method in lat...
متن کاملDouble-layer Modificatory Linguistic Truth-value Lattice-valued Evaluation Method
In this paper, a double-layer modificatory linguistic truth-value lattice-valued evaluation method is presented. Its logic basic is based on modificatory linguistic truth-value lattice-valued proposition logic system MLTVLP(X) and operator modificatory linguistic truth-value lattice-valued proposition logic OMLTVLP(X). MLTVLP(X) and OMLTVLP(X) are similar to LTVLP(X) and MLTVLP(X), which have b...
متن کاملA Resolution Method for Linguistic Many-valued Logic
This paper studies the linguistic truth value domain (AX) based on finite monotonous hedge algebra and then we extend lukasiewicz algebra on [0, 1] to linguistic lukasiewicz algebra on linguistic truth value domain (AX), in an attempt to propose a general resolution for linguistic many-valued logic based on hedge moving rules and linguistic lukasiewicz algebra for linguistic reasoning. Its theo...
متن کاملLinguistic-Valued Approximate Reasoning With Lattice Ordered Linguistic-Valued Credibility
Linguistic terms are often used to represent the truth degree or credibility degree to manage the uncertainty or imprecision as one of popular ways of knowledge representation in the perception-based decision making problem. This present work represents the credibility of uncertain knowledge using linguistic values. The linguistic-valued credibility is then modeled based on a lattice ordered lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2012
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2012.747665