Abstract
This paper focuses on efficient non-clausal resolution-based automated reasoning methods and algorithms for a lattice-ordered linguistic truth-valued logic, which corresponds to extensions of α-lock resolution. Firstly, α-generalized lock resolution is proposed for lattice-valued propositional logic and first order logic, respectively, along with their concepts, soundness and completeness. Then, α-generalized lock resolution for first order linguistic truth-valued lattice-valued logic \(\mathscr{L}_{V(n\times2)}\rm{F(X)}\) is equivalently transformed into that for propositional logic LnP(X), which can greatly reduce the complexity of the resolution procedure. Finally, α-generalized linear semi-lock resolution is discussed, and its general algorithm is also contrived. This work provides more efficient and natural resolution automated reasoning scheme in linguistic truth-valued logic based on lattice implication algebra with the aim at establishing formal tools for symbolic natural language processing.
Article PDF
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
G. Aguilera, IP De Guzman, M. Ojeda-Aciego and A. Valverde, “Reductions for non-clausal theorem proving,” Theoretical Computer Science, 266(1–2): 81–112 (2001).
C. Areces and D. Gorín, “Resolution with order and selection for hybrid logics,” Journal of Automated Reasoning, 46(1): 1–12 (2011).
R. Boyer, “Locking: A restriction of resolution,” PhD thesis, University of Texas at Austin (1971).
C. Dixon, M. Fisher, M. Wooldridge, “Resolution for temporal logics of knowledge,” Journal of Logic and Computation, 8(3): 345–372 (1998).
X.X. He, J. Liu, Y. Xu, L. Martínez, D. Ruan, “On α-satisflability and its α-lock resolution in a finite lattice-valued propositional logic,” Logic Journal of IGPL, 20 (3): 579–588 (2012).
X.X. He, Y. Xu, J. Liu, D. Ruan, “α-Lock resolution method for a lattice-valued first-order logic,” Engineering Applications of Artificial Intelligence, 24(7): 1274–1280 (2011).
X.X. He, Y. Xu, J. Liu, S.W. Chen, “On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic,” Soft Computing, 16(4): 699–709 (2012).
U. Hustadt, R.A. Schmidt, “Using resolution for testing modal satisfiability and building models,” Journal of Automated Reasoning, 28(2): 205–232 (2002).
J. Liu, D. Ruan, Y Xu, Z.M. Song. “A resolution-like strategy based on a lattice-valued logic,” IEEE Transaction on Fuzzy System, 11(4): 560–567 (2003).
X.H. Liu, “Automated reasoning based on resolution methods,” Science Press, Beijing (In Chinese)(1994).
X.H. Liu, J.G. Sun, “Generalized resolution and NC-resolution,” Journal of Computer Science and Technology, 9(2): 160–167 (1994).
J. Ma, W.J. Li, D. Ruan, and Y Xu. “Filter-based resolution principle for lattice-valued propositional logic LP(X),” Information Sciences, 177(4): 1046–1062 (2007).
N.V. Murray. “Completely non-clausal theorem proving,” Artificial Intelligence, 18(1): 67–85 (1982).
J.A. Navarro, A. Voronkov, “Generation of hard non-clausal random satisfiability problems,” Proceedings of the national conference on artificial intelligence (AAAI), 20(1): 436–442 (2005).
P.W. O’Hearn, Z. Stachniak, “A resolution framework for finitely-valued first-order logics,” Journal of Symbolic Computation, 13(3): 235–254 (1992).
Z. Pei, D. Ruan, J. Liu, Y Xu, “Linguistic values-based intelligent information processing: theory, methods, and applications,” Atlantis Press, Paris (2009).
D.A. Plaisted, S. Greenbaum, “A structure-preserving clause form translation,” Journal of Symbolic Computation, 2(3): 293–304 (1986).
K.Y Qin, Y. Xu. “Lattice-valued proposition logic (II),” Journal of Southwest Jiaotong University, 2(1): 22–27 (1994).
J.A. Robinson, “A machine-oriented logic based on the resolution principle,” Journal of the ACM, 12(1): 23–11 (1965).
R. Sebastiani, “Applying GSAT to non-clausal formulas,” Journal of Artificial Intelligence Research, 1(1): 309–314(1993).
Z. Stachniak, “Non-clausal reasoning with definite theories,” Fundamenta Informaticae, 48(4): 363–388 (2001).
Z. Stachniak, A. Belov, “Weighting strategy for non-clausal resolution,” Journal of Experiment Theory Artificial Intelligence, 20(1): 61–78 (2008).
J.G. Sun, X.H Liu, “Generalized linear semi-lock resolution,” Chinese Bulletin, 37(19): 1812–1814 (1992).
X.H. Wang, X.H. Liu, “Generalized resolution,” The Chinese Journal of Computers, 5(2): 81–92 (1982).
WT. Xu, Y Xu, “α-Generalized linear resolution method based on lattice-valued propositional logic LP(X),” 2011 Eighth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD), 26–28 July, Shanghai, 1413–1417 (2011).
Y Xu, “Lattice implication algebras,” Journal of Southwest Jiaotong University, 89(1): 20–27 (in Chinese) (1993).
Y Xu, K.Y. Qin, “Lattice-valued propositional logic (I),” Journal of Southwest Jiaotong University, 1(2): 123–128 (1993).
Y. Xu, D. Ruan, E.E. Kerre, J. Liu, “a-Resolution principle based on lattice-valued propositional logic LP(X),” Information Sciences, 130(1–4): 195–223 (2000).
Y. Xu, D. Ruan, E.E. Kerre, J. Liu, “a-Resolution principle based on first-order lattice-valued logic LF(X),” Information Sciences, 132(1–4): 221–239 (2001).
Y. Xu, D. Ruan, K.Y Qin, J. Liu, “Lattice-valued logic-An alternative approach to treat fuzziness and incomparability,” Springer-Verlag, Berlin (2003).
Y Xu, J. Liu, D. Ruan, T.T. Lee. “On the consistency of rule bases based on lattice-valued first-order logic LF(X),” International Journal of Intelligent Systems, 21(4): 399–124 (2006).
Y Xu, W.T. Xu, X.M. Zhong, X.X. He, “α-Generalized resolution principle based on lattice-valued propositional logic system LP(X),” The 9th International FLINS Conference on Foundations and Applications of Computational Intelligence (FLINS2010), 2–4 August, Emei, China, 66–71 (2010).
Y Xu, J. Liu, D. Ruan, X.B. Li, “Determination of α-resolution in lattice-valued first-order logic LF(X),” Information Sciences. 181(10): 1836–1862 (2011).
Y Xu, X.X. He, J. Liu, S.W. Chen, “A general form of α-generalized resolution based on lattice-valued logic,” Submitted to International Journal of Computational Intelligence Systems (2011).
L.A. Zadeh, “The concept of linguistic variable and its application to approximate reasoning,” Information Sciences, I: 8, 199–249; II: 8, 310–357; III: 9, 43–80 (1975).
L.A. Zadeh, J. Kacprzyk, “Computing with words in information / intelligent system: Foundations,” Springer-Verlag, Berlin (1999).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).
About this article
Cite this article
He, X., Xu, Y., Liu, J. et al. α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic. Int J Comput Intell Syst 5, 1120–1134 (2012). https://doi.org/10.1080/18756891.2012.747665
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1080/18756891.2012.747665