Automated reasoning algorithm for linguistic valued Łukasiewicz propositional logic

Jun Liu, Luis Martínez López, Yang Xu, Zhirui Lu

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    5 Citations (Scopus)

    Abstract

    In this paper, firstly a new automated reasoning algorithm based on Boolean logic is proposed and its theorems of soundness and completeness on validating the unsatisfiability of logic formulae are given. Then this procedure is extended to a linguistic valued Lukasiewicz propositional logic L(X) with truth-value in Lukasiewicz linguistic valued algebras, and an α-automated reasoning algorithm with respect to certain linguistic value level a in L(X) is given. Its theorems of soundness and completeness associated with the α-unsatisfiability of the logical formulae in L(X) are also proved. This reflects the symbolic approach acts by direct reasoning on linguistic truth values.

    Original languageEnglish
    Title of host publication37th International Symposium on Multiple-Valued Logic, ISMVL 2007
    DOIs
    Publication statusPublished - 2007
    Event37th International Symposium on Multiple-Valued Logic, ISMVL 2007 - Oslo, Norway
    Duration: 13 May 200716 May 2007

    Publication series

    NameProceedings of The International Symposium on Multiple-Valued Logic
    ISSN (Print)0195-623X

    Conference

    Conference37th International Symposium on Multiple-Valued Logic, ISMVL 2007
    CountryNorway
    CityOslo
    Period13/05/0716/05/07

    Fingerprint

    Dive into the research topics of 'Automated reasoning algorithm for linguistic valued Łukasiewicz propositional logic'. Together they form a unique fingerprint.

    Cite this