Skip to main content
SpringerLink
Log in

On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic

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

Abstract

The paper focuses on the efficient resolution-based automated reasoning theory, approach and algorithm for a lattice-ordered linguistic truth-valued logic. Firstly two hybrid resolution methods in linguistic truth-valued lattice-valued logic are proposed by combining α-lock resolution with generalized deleting strategy and α-linear resolution. α-Lock resolution for first-order linguistic truth-valued lattice-valued logic \(\fancyscript{L}_{V(n \times 2)}F(X)\) is equivalently transformed into that for propositional logic \(L_{n}P(X)\) which reduce much the complexity of the resolution procedure. Then the compatibilities of α-lock resolution with generalized deleting strategy and α-linear resolution are discussed. We finally contrive an algorithm for α-linear semi-lock resolution and some examples are provided to illustrate the proposed theory and algorithm. This work provides effective support for automated reasoning scheme in linguistic truth-valued logic based on lattice-valued algebra with the aim at establishing formal tools for symbolic natural language processing.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

References

  • Baaz M, Fermvller CG (1995) Resolution-based theorem proving for many valued logics. J Symb Comput 19(4):353–391

    Article  MATH  Google Scholar 

  • Boyer R (1971) Locking: a restriction of resolution. PhD thesis, University of Texas at Austin

  • Chang CL, Lee RCT (1997) Symbolic logic and mechanical theorem proving. Academic Press, USA

    Google Scholar 

  • Constable R, Moczydlowski W (2009) Extracting the resolution algorithm from a completeness proof for the propositional calculus. Ann Pure Appl Log 161(3):337–348

    Article  MathSciNet  MATH  Google Scholar 

  • Degtyareva A, Nieuwenhuisb R, Voronkov A (2003) Stratified resolution. J Symb Comput 36(1-2):79–99

    Article  Google Scholar 

  • Fermvller CG, Leitsch A, Hustadt U, Tammet T (2001) Resolution decision procedures. In: Handbook of Automated Reasoning, pp 1791–1849

  • Galmiche D (2000) Connection methods in linear logic and proof nets construction. Theor Comput Sci 232(1–2):231–272

    Article  MathSciNet  MATH  Google Scholar 

  • He XX, Liu J, Xu Y, Martínez L, Ruan D (2011a) On α-satisfiability and its α-lock resolution in a finite lattice-valued propositional logic. Log J IGPL. doi:10.1093/jigpal/jzr007 (Epub ahead of print)

  • He XX, Xu Y, Liu J, Ruan D (2011b) α-Lock resolution method for a lattice-valued first-order logic. Eng Appl Artif Intell 24(7):1274–1280

    Article  Google Scholar 

  • Lai JJ, Xu Y (2010) Linguistic truth-valued lattice-valued propositional logic system LP(X) based on linguistic truth-valued lattice implication algebra. Inf Sci 180(10):1990–2002

    Article  MathSciNet  MATH  Google Scholar 

  • Liu XH (1994) Automated reasoning based on resolution methods. Science Press, Beijing (in Chinese)

    Google Scholar 

  • Liu XH, Yang YP (1991) Linear semi-lock resolution. Chin Sci Bull 36(9):778–781

    MATH  Google Scholar 

  • Liu J, Ruan D, Xu Y, Song ZM (2003) A resolution-like strategy based on a lattice-valued logic. IEEE Trans Fuzzy Syst 11(4):560–567

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Ma J, Ruan D, Xu Y, Zhang G (2007b) A fuzzy-set approach to treat determinacy and consistency of linguistic terms in multi-criteria decision making. Int J Approx Reason 44(2):165–181

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  • Mundici D, Olivetti N (1998) Resolution and model building in the infinite-valued calculus of \({\L}\)ukasiewicz. Theor Comput Sci 200(1–2):335–366

    Article  MathSciNet  MATH  Google Scholar 

  • Qin KY, Xu Y (1994) Lattice-valued proposition logic (II). J Southwest Jiaotong Univ 2(1):22–27

    MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Tammet T (1991) Resolution methods for decision problems and finite-model building. Balt Comput Sci 502:33–64

    Article  MathSciNet  Google Scholar 

  • Tammet T (1994) Proof strategies in linear logic. J Autom Reason 12(3):273–304

    Article  MathSciNet  MATH  Google Scholar 

  • Xu Y (1993) Lattice implication algebras. J Southwest Jiaotong Univ 89(1):20–27 (in Chinese)

    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(1-4):195–223

    Article  MathSciNet  MATH  Google Scholar 

  • Xu Y, Ruan D, Kerre EE, Liu J (2001) α-Resolution principle based on first-order lattice-valued logic LF(X). Inf Sci 132(1-4):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. Springer-Verlag, Heidelberg

    MATH  Google Scholar 

  • Xu Y, Chen SW, Ma J (2006a) Linguistic truth-valued lattice implication algebra and its properties. In: IMACS Multi-conference on Computational Engineering in System Application, pp 1413–1418

  • Xu Y, Liu J, Ruan D, Lee TT (2006b) On the consistency of rule bases cased on lattice-valued first-order logic LF(X). Int J Intell Syst 21(4):399–424

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Wang XX, Hu XH (1999) Approximate reasoning based on linguistic truth value with α-operator. Fuzzy Sets Syst 105(3):401–407

    Article  MATH  Google Scholar 

  • Zadeh LA (1975) The concept of linguistic variable and its application to approximate reasoning. Inf Sci I 8(3):199–249

    Article  MathSciNet  Google Scholar 

  • Zadeh LA (1975) The concept of linguistic variable and its application to approximate reasoning. Inf Sci II 8(4):310–357

    Google Scholar 

  • Zadeh LA (1975) The concept of linguistic variable and its application to approximate reasoning. Inf Sci III 9(1):43–80

    MathSciNet  Google Scholar 

  • Zadeh LA, Kacprzyk J (1999) Computing with words in information/intelligent system: foundations. Springer-Verlag, Berlin

    Google Scholar 

Download references

Acknowledgments

This work is partially supported by the National Natural Science Foundation of China (Grant No. 60875034) and the research project (TIN-2006-02121 and P08-TIC-3548). The authors wish to thank to the editor Professor Luis Martínez and the anonymous reviewers for their valuable comments and suggestions that greatly enhanced the quality of this paper.

Author information

Authors and Affiliations

  1. Intelligent Control Development Center, Southwest Jiaotong University, Chengdu, 610031, Sichuan, People’s Republic of China

    Xingxing He & Yang Xu

  2. School of Computing and Mathematics, University of Ulster, Northern Ireland, UK

    Jun Liu & Shuwei Chen

Authors
  1. Xingxing He
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jun Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shuwei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xingxing He.

Rights and permissions

Reprints and permissions

About this article

Cite this article

He, X., Xu, Y., Liu, J. et al. On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic. Soft Comput 16, 699–709 (2012). https://doi.org/10.1007/s00500-011-0779-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-011-0779-z

Keywords

Search

Navigation