α-satisfiability and α-lock resolution for a lattice-valued logic LP(X)

Authors:
Xingxing He;Yang Xu;Yingfang Li;Jun Liu;Luis Martinez;Da Ruan
Affiliations:
Intelligent Control Development Center, Southwest Jiaotong University, Chengdu, Sichuan, PR China;Intelligent Control Development Center, Southwest Jiaotong University, Chengdu, Sichuan, PR China;Department of Mathematics, Southwest Jiaotong University, Chengdu, Sichuan, PR China;School of Computing and Mathematics, University of Ulster, Northern Ireland, UK;Department of Computing, University of Jaén, Jaén, Spain;Belgian Nuclear Research Centre (SCK∘CEN), Mol, and Ghent University, Belgium
Venue:
HAIS'10 Proceedings of the 5th international conference on Hybrid Artificial Intelligence Systems - Volume Part II
Year:
2010

Citing 6
Cited 1

Automated reasoning: 33 BASIC research problems

Automated reasoning: 33 BASIC research problems
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
&agr;-resolution principle based on lattice-valued propositional logic LP(X)

Information Sciences: an International Journal
&agr;-resolution principle based on first-order lattice-valued logic LF (X)

Information Sciences: an International Journal
Filter-based resolution principle for lattice-valued propositional logic LP(X)

Information Sciences: an International Journal
A resolution-like strategy based on a lattice-valued logic

IEEE Transactions on Fuzzy Systems

α-Lock resolution method for a lattice-valued first-order logic

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on some automated reasoning issues for a kind of lattice-valued logic LP(X) based on lattice-valued algebra Firstly some extended strategies from classical logic to LP(X) are investigated in order to verify the α-satisfiability of formulae in LP(X) while the main focus is given on the role of constant formula played in LP(X) in order to simply the verification procedure in the semantic level Then, an α-lock resolution method in LP(X) is proposed and the weak completeness of this method is proved The work will provide a support for the more efficient resolution based automated reasoning in LP(X).