Abstract
This paper analyzes the characteristics of α-generalized semantic resolution, α-generalized linear resolution, and α-generalized lock resolution from their validity, complexity, and practicability in \( \fancyscript{L}_{n\times 2}\)F(X). Some examples are given to illustrate the efficiency of three non-clausal resolution methods.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Liu XH (1994) Automated reasoning based on resolution methods. Science Press, Beijing (In Chinese)
Murray NV (1982) Completely non-clausal theorem proving. Artif Intell 18:67–85
Robinson JA (1965) A machine-oriented logic based on the resolution principle. J ACM 12(1):23–41
Xu Y, Ruan D, Qin KY, Liu J (2003) Lattice-valued logic-an alternative approach to treat fuzziness and incomparability. Springer, Berlin
Xu Y, Xu WT, Zhong XM, He XX (2010) α-generalized resolution principle based on lattice-valued propositional logic system LP(X). In: The 9th international FLINS conference on foundations and applications of computational intelligence (FLINS2010), Aug. 2–4, 2010, Chengdu, China, 66–71
Zhong XM (2012) α-Quasi lock semantic resolution for linguistic truth-valued lattice-valued logic. In: PhD thesis, Southwest Jiaotong University
Xu WT (2011) α-Generalized linear resolution for linguistic truth-valued lattice-valued logic. In: PhD thesis, Southwest Jiaotong University
He XX, Xu Y, Liu J, Chen SW (2012) α-Generalized lock resolution method in linguistic truth-valued lattice-valued logic. Int J Comput Intell Syst 5(6):1120–1134
He XX, Liu J, Xu Y, Martnez L, Ruan D (2012) On α-satisfiability and its α-lock resolution in a finite lattice-valued propositional logic. Logic J IGPL 20(3):579–588
He XX, Xu Y, Liu J, Ruan D (2011) α-Lock resolution method for a lattice-valued first-order logic. Eng Appl Artif Intell 24(7):1274–1280
He XX, Xu Y, Liu J, Chen SW (2012) On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic. Soft Comput 16(4):699–709
He XX (2012) α-Generalized lock resolution for linguistic truth-valued lattice-valued logic. PhD thesis, Southwest Jiaotong University
Alsuwaiyel MH (1999) Algorithm design techniques and analysis. World Scientific
Dahllf V (2006) Exact algorithms for exact satisfiability problems. PhD thesis, University of Linkoping
Gacs P, Lovasz L (1999) Complexity of algorithms. Yale University, Lecture Notes
Wahlstrm M (2007) Algorithms, measures and upper bounds for satisfiability and related problems. PhD thesis, University of Linkoping
Boyer R (1971) Locking: a restriction of resolution. PhD thesis, University of Texas at Austin
Acknowledgments
This work is partially supported by the National Natural Science Foundation of China (Grant Nos. 61305074, 61175055, 61105059, and 61100046) and Sichuan Key Technology Research and Development Program under Grant No. 2011FZ0051.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, X., Xu, Y., Liu, J., Zhong, X., Xu, P. (2014). Comparisons Among α-Generalized Resolution Methods in \(\fancyscript{L}_{n \times 2}\)F(X). In: Wen, Z., Li, T. (eds) Foundations of Intelligent Systems. Advances in Intelligent Systems and Computing, vol 277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-54924-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-54924-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-54923-6
Online ISBN: 978-3-642-54924-3
eBook Packages: EngineeringEngineering (R0)