2014/03/25 by Thi-Minh-Tam Nguyen, Nguyen, Thi-Minh-Tam, Viet-Trung Vu +5
Computer Science · #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #cs.LO
paper · pdf · doi:10.48550/arxiv.1403.6237
IPMU 2014 Full paper (14 pages)
arxiv created 2014/03/30 · arxiv updated 2014/04/01
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.