α-Satisfiability and α-Lock Resolution for a Lattice-Valued Logic LP(X)
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).
Keywordslattice-valued logic α-resolution principle α-satisfiability α-lock resolution method
Unable to display preview. Download preview PDF.
- 2.Liu, X.H.: Resolution-Based Automated Reasoning. Academic Press, Beijing (1994) (in Chinese)Google Scholar
- 3.Wos, L.: Automated Reasoning: 33 Basic Research Problems. Prentice Hall, New Jersey (1988)Google Scholar
- 4.Wang, G.J., Zhou, H.J.: Introduction to Mathematical Logic and Resolution Principle, 2nd edn. Science Press, Beijing (2006)Google Scholar
- 5.Xu, Y.: Lattice implication algebra. J. Southwest Jiaotong University 1, 20–27 (1993)Google Scholar