Resolution in Linguistic First Order Logic Based on Linear Symmetrical Hedge Algebra

Abstract

Abstract. This paper focuses on resolution in linguistic first order logic with truth value taken from linear symmetrical hedge algebra. We build the basic components of linguistic first order logic, including syntax and semantics. We present a resolution principle for our logic to resolve on two clauses having contradictory linguistic truth values. Since linguistic information is uncertain, inference in our linguistic logic is approximate. Therefore, we introduce the concept of reliability in order to capture the natural approximation of the resolution inference rule.

Resolution Method in Linguistic Propositional Logic

“…Le et al [14] introduced the fuzzy linguistic logic programming whose truth value domain is based on monotone symmetrical finite hedge algebras, then gave a procedural semantics based on many-valued modus ponens. Nguyen et al [17], [18] presented linguistic logics with truth-valued domain based on linear symmetrical hedge algebra. Lai and Xu [15] presented a linguistic truth-valued lattice-valued propositional logic system, called lP(X)P(X), whose truth value domain is a lattice implication algebra.…”