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

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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 converse 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. © Springer International Publishing Switzerland 2014.

Cite

CITATION STYLE

APA

Nguyen, T. M. T., Vu, V. T., Doan, T. V., & Tran, D. K. (2014). Resolution in Linguistic First Order Logic Based on Linear Symmetrical Hedge Algebra. In Communications in Computer and Information Science (Vol. 442 CCIS, pp. 345–354). Springer Verlag. https://doi.org/10.1007/978-3-319-08795-5_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free