nach oben

Soft Computing

Erschienen in:

01.04.2012 | Original Paper

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

verfasst von: Xingxing He, Yang Xu, Jun Liu, Shuwei Chen

Erschienen in: Soft Computing | Ausgabe 4/2012

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

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.

Vorheriger Artikel How landscape ruggedness influences the performance of real-coded algorithms: a comparative study

Nächster Artikel Learnable tabu search guided by estimation of distribution for maximum diversity problems

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

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

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

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

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

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–272MathSciNetMATHCrossRef

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–1280CrossRef

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–2002MathSciNetMATHCrossRef

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

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

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–567CrossRef

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–1062MathSciNetMATHCrossRef

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–181MathSciNetMATHCrossRef

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

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

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

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

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

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

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

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

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–223MathSciNetMATHCrossRef

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–239MathSciNetMATHCrossRef

Xu Y, Ruan D, Qin KY, Liu J (2003) Lattice-valued logic-an alternative approach to treat fuzziness and incomparability. Springer-Verlag, HeidelbergMATH

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–424MATHCrossRef

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–1862MathSciNetMATHCrossRef

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

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

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

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

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

Titel: On compatibilities of α-lock resolution method in linguistic truth-valued lattice-valued logic
verfasst von: Xingxing He
Yang Xu
Jun Liu
Shuwei Chen
Publikationsdatum: 01.04.2012
Verlag: Springer-Verlag
Erschienen in: Soft Computing / Ausgabe 4/2012
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI: https://doi.org/10.1007/s00500-011-0779-z

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 4/2012

Isomorphism between two BL-general fuzzy automata

Learnable tabu search guided by estimation of distribution for maximum diversity problems

A modified learning algorithm for the multilayer neural network with multi-valued neurons based on the complex QR decomposition

Impacts of sampling strategies in tournament selection for genetic programming

Consensus reaching models of linguistic preference relations based on distance functions

Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems

Premium Partner