α-ordered linear resolution method for lattice-valued logic system based on lattice implication algebra
by Weitao Xu; Yang Xu
International Journal of Applied Management Science (IJAMS), Vol. 4, No. 4, 2012

Abstract: An α-ordered linear resolution method for lattice-valued logic based on lattice implication algebra is proposed to provide an efficient resolution approach for resolution-based mechanical theorem proving. Firstly, some essential concepts for α-ordered linear resolution are given. The α-ordered linear resolution method for lattice-valued propositional logic system LP(X) based on lattice implication algebra is presented. Both soundness and weak completeness theorems are established. Secondly, the lifting lemma is established from LP(X) to LF(X), which is then used for obtaining the weak completeness theorem of α-ordered linear resolution method in LF(X) based on lattice implication algebra. Finally, an α-ordered linear resolution automated reasoning algorithm for lattice-valued logic system based on lattice implication algebra is designed.

Online publication date: Sat, 16-Aug-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Applied Management Science (IJAMS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com