α-ordered linear resolution method for lattice-valued logic system based on lattice implication algebra

Weitao Xu and Yang Xu

International Journal of Applied Management Science, 2012, vol. 4, issue 4, 460-479

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.

Keywords: automated reasoning; lattice implication algebra; lattice-valued logic; alpha-ordered linear resolution; ordered generalised clause. (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=49930 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:injams:v:4:y:2012:i:4:p:460-479

Access Statistics for this article

More articles in International Journal of Applied Management Science from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().