Skip to main content
Log in

General form of α-resolution principle for linguistic truth-valued lattice-valued logic

  • Original Paper
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This paper is focused on resolution-based automated reasoning theory in linguistic truth-valued lattice-valued logic based on linguistic truth-valued lattice implication algebra. Concretely, the general form of α-resolution principle based on the above lattice-valued logic is equivalently transformed into another simpler lattice-valued logic system. Firstly, the general form of α-resolution principle for lattice-valued propositional logic \( ({\fancyscript{L}}_{n} \times {\fancyscript{L}}_{2}){\text{P(X)}} \) is equivalently transformed into that for lattice-valued propositional logic \( \fancyscript{L}_{n} \)P(X). A similar conclusion is obtained between the general form of α-resolution principle for linguistic truth-valued lattice-valued propositional logic \({\fancyscript{L}}_{V(n \times 2)}\)P(X) and that for lattice-valued propositional logic \({\fancyscript{L}}_{Vn} \)P(X). Secondly, the general form of α-resolution principle for lattice-valued first-order logic \( ({\fancyscript{L}}_{n} \times {\fancyscript{L}}_{2}) \)F(X) is equivalently transformed into that for \({\fancyscript{L}}_{n} \)P(X). Similarly, this conclusion also holds for linguistic truth-valued lattice-valued first-order \({\fancyscript{L}}_{V(n \times 2)} \)F(X) and \({\fancyscript{L}}_{Vn} \)P(X). The presented work provides a key theoretical support for automated reasoning approaches and algorithms in linguistic truth-valued logic, which can further support linguistic information processing for decision making, i.e., reasoning with words.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Aguilera G, de Guzmán L, Ojeda-Aciego M, Valverde A (2001) Reductions for non-clausal theorem proving. Theor Comput Sci 266:81–112

    Article  MATH  Google Scholar 

  • Baaz M, Fermüller CG (1995) Resolution-based theorem proving for many-valued logics. J Symbol Comput 19:353–391

    Article  MATH  Google Scholar 

  • Baaz M, Leitsch A (1992) Complexity of resolution proofs and function introduction. Ann Pure Appl Logic 57:181–215

    Article  MathSciNet  MATH  Google Scholar 

  • Dubois D, Prade H (1990) Resolution principle in possibilistic logic. Int J Approx Reason 4(1):1–21

    Article  MathSciNet  MATH  Google Scholar 

  • Dubois D, Lang J, Prade H (1987) Theorem proving under uncertainty—a possibility theory based approach. In: Proceedings of the international joint conference on artificial intelligence (IJCAI’87), Milano, Italy, pp 984–986

  • Dubois D, Lang J, Prade H (1989) Automated reasoning using possibility logic semantics, belief revision and variable certainty weights. In: Proceedings of the fifth workshop on uncertainty in artificial intelligence, Windsor, Ontario, pp 81–87

  • Gabbay DM, Reyle U (1997) Labelled resolution for classical and non-classical logics. Stud Log 59:179–216

    Article  MathSciNet  MATH  Google Scholar 

  • Guller D (2008) Binary resolution over complete residuated stone lattices. Fuzzy Sets Syst 159:1031–1041

    Article  MathSciNet  MATH  Google Scholar 

  • Hahnle R (1990) Towards an efficient tableau proof procedure for multiple-valued logics. In: Proceedings of the workshop on computer science logic. Lecture Notes in Computer Science, vol 533, Springer, Berlin, pp 248–260

  • Hahnle R (1991) Uniform notation tableau rules for multiple-valued logics. In: Proceedings of the international symposium on multiple-valued logic, Victoria, BC, pp 238–245

  • Hahnle R (1993a) Automated deduction in multiple-valued logics. Oxford University Press, Oxford

    Google Scholar 

  • Hahnle R (1993b) Short CNF in finitely-valued logics. In: Komorowski J, Ras ZW (eds) Proceedings of the seventh international symposium on methodologies for intelligent systems, pp 49–58

  • Lee RCT (1972) Fuzzy logic and the resolution principle. J ACM 19:109–119

    Article  MATH  Google Scholar 

  • Lee RCT, Chang CL (1971) Some properties of fuzzy logic. Inf Control 19:417–431

    Article  MathSciNet  Google Scholar 

  • Li XB, Qiu XP, Chang ZY, Xu Y (2008) The properties of α-resolution and J-resolution based on lattice-valued propositional logic system. Chin Q J Math 6:262–269 (in Chinese)

    Google Scholar 

  • Liu XH (1989) Fuzzy logic and fuzzy reasoning, Press of Ji Lin University, Changchun (in Chinese)

  • Liu XH (1994) Resolution-based automated reasoning. Academic Press, China (in Chinese)

    Google Scholar 

  • Liu XH, Xiao H (1985) Operator fuzzy logic and fuzzy resolution. In: Proceedings of the fifth IEEE international symposium on multiple-valued logic (ISMVL’85), Kingston, Canada, pp 68–75

  • Ma J, Li WJ, Ruan D, Xu Y (2007) Filter-based resolution principle for lattice-valued propositional logic LP(X). Inf Sci 177:1046–1062

    Article  MathSciNet  MATH  Google Scholar 

  • Meng D, Xu Y, Jia HD (2005) Resolution principle based on six lattice-valued first-order logic L6F(X). In: Proceedings of 2005 IEEE networking, sensing and control conference, 2005, pp 838–843

  • Morgan CG (1976) Resolution for many-valued logics. Logique et Analyses 19(74–76):311–339

    MATH  Google Scholar 

  • Mukaidono M (1975) On some properties of fuzzy logic. Syst Comput Control 6(2):36–43

    MathSciNet  Google Scholar 

  • Mukaidono M (1982) Fuzzy inference of resolution style. In: Yager RR (ed) Fuzzy sets and possibility theory. Pergamon Press, New York, pp 224–231

    Google Scholar 

  • Murray NV, Rosenthal E (1991) Resolution and path dissolution in multiple-valued logics. In: Proceedings of the sixth international symposium on methodologies for intelligent systems, Charlotte. Lecture Notes in Artificial Intelligence, vol 542, pp 570–579

  • Murray NV, Rosenthal E (1991) Improving tableau proof in multiple-valued logic. In: Proceedings of the 21st international symposium on multiple-valued logic, Victoria, BC, Canada, pp 230–237

  • Orlowska E (1978) The resolution principle for ω+-valued logic. Fundamenta Informaticae II(1):1–15

    MathSciNet  Google Scholar 

  • Orlowska E (1980) Resolution system and their application II. Fundamenta Informaticae III(3):333–362

    MathSciNet  Google Scholar 

  • Orlowska E (1985) Mechanical proof methods for Post logics. Logique et Analyses 28(110):173–192

    MathSciNet  MATH  Google Scholar 

  • Orlowska E, Wierzchon S (1985) Mechanical reasoning in fuzzy logics. Logique et Analyses 110–111:193–207

    MathSciNet  Google Scholar 

  • Pei Z, Ruan D, Liu J, Xu Y (2009) Linguistic values based intelligent information processing: theory, methods, and applications. Atlantis Press/World Scientific, Paris/Singapore

  • Qin KY, Xu Y, Song ZM (1997) Lattice-valued propositional logic LP(X) (I). Fuzzy Syst Math 11(4):5–10 (in Chinese)

    Google Scholar 

  • Robinson JP (1965) A machine-oriented logic based on the resolution principle. J ACM 12:23–41

    Article  MATH  Google Scholar 

  • Schmitt PH (1986) Computational aspects of three-valued logic. In: Siekmann JH (ed) Proceedings of the eighth international conference on automated deduction, Springer, Berlin, pp 190–198

  • Wang W (2007) Research on resolution principle based on L6P(X), Southwest Jiaotong University Postdoctoral Research Report (in Chinese)

  • Wang W, Xu Y, Qin KY (2003) The structure and α-resolution field of indecomposable extremely simple forms of lattice-valued propositional logic LP(X). J Fuzzy Math 11(4):877–891

    MathSciNet  MATH  Google Scholar 

  • Weigert TJ, Tsai JP, Liu XH (1993) Fuzzy operator logic and fuzzy resolution. J Autom Reason 10:59–78

    Article  MathSciNet  MATH  Google Scholar 

  • Xu Y, Qin KY (1993) Lattice-valued propositional logic (I). J Southwest Jiaotong Univ 1(2):123–128

    MathSciNet  MATH  Google Scholar 

  • Xu Y, Ruan D, Kerre EE, Liu J (2000) α-Resolution principle based on lattice-valued propositional logic LP(X). Inf Sci 130:195–223

    Article  MathSciNet  MATH  Google Scholar 

  • Xu Y, Ruan D, Kerre EE, Liu J (2001) α-Resolution principle based on lattice-valued first-order lattice-valued logic LF(X). Inf Sci 132:221–239

    Article  MathSciNet  MATH  Google Scholar 

  • Xu Y, Ruan D, Qin KY, Liu J (2003) Lattice-valued logic: an alternative approach to treat fuzziness and incomparability, ISBN-3-540-40175-X. Springer, Heidelberg

  • Xu Y, Chen SW, Ma J (2006) Linguistic truth-valued lattice implication algebra and its properties. In: Proceedings of the IMACS MuLticonference on computational engineering in systems applications (CESA2006), Beijing, China, 2006, pp 1413–1418

  • Xu Y, Chen SW, Liu J, Ruan D (2007a) Weak completeness of resolution in a linguistic truth-valued propositional logic. In: Proceedings of the IFSA2007: theoretical advances and applications of fuzzy logic and soft computing (IFSA2007), Cancun, Mexico, 2007, pp 358–366

  • Xu Y, Li XB, Liu J, Ruan D (2007b) Determination of α-resolution for lattice-valued first-order logic based on lattice implication algebra. In: Proceedings of the 2007 international conference on intelligent systems and knowledge engineering, Chengdu, China, 2007, pp 1567–1573

  • Xu Y, Xu WT, Zhong XM, He XX (2010) α-generalized resolution principle based on lattice-valued propositional logic LP(X). In: Proceedings of the 9th international FLINS conference (FLINS2010), Emei, Chengdu, China, 2010, pp 66–71

  • Xu Y, Zhong XM, Liu J, Chen SW (2011a) General form of α-resolution principle based on lattice-valued logic with truth-value in lattice implication algebras. Inf Sci (submitted)

  • Xu Y, Liu J, Ruan D, Li XB (2011b) Determination of α-resolution in lattice-valued first-order logic LF(X). Inf Sci 181:1836–1862

    Article  MathSciNet  MATH  Google Scholar 

  • Yager RR (1985) Inference in a multiple-valued logic system. Int J Man Mach Stud 23:27–44

    Article  MATH  Google Scholar 

  • Zou L, Ruan D, Pei Z, Xu Y (2008) A linguistic truth-valued reasoning approach in decision making with incomparable information. J Intell Fuzzy Syst 19(4–5):335–343

    MATH  Google Scholar 

  • Zou L, Pei Z, Liu X, Xu Y (2009) Semantics of linguistic truth-valued intuitionistic fuzzy proposition calculus. Int J Innov Comput Inf Control 5(12):4745–4752

    Google Scholar 

  • Zou L, Ruan D, Pei Z, Xu Y (2011) A linguistic-valued lattice implication algebra approach for risk analysis. J Multi-Valued Logic Soft Comput 17:293–303

    MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This work is partially supported by the National Natural Science Foundation of P. R. China (Grant No. 60875034, 61175055, 61100046); the project TIN-2009-0828; Sichuan Key Technology Research and Development Program of China (Grant No. 2011FZ0051) and Wireless Administration of Ministry of Industry and Information Technology of China ([2011]146).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jun Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhong, X., Xu, Y., Liu, J. et al. General form of α-resolution principle for linguistic truth-valued lattice-valued logic. Soft Comput 16, 1767–1781 (2012). https://doi.org/10.1007/s00500-012-0860-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-012-0860-2

Keywords

Navigation