2013/07/29 by Thi-Minh-Tam Nguyen, Nguyen, Thi-Minh-Tam, Viet-Trung Vu +5
Computer Science · #Advanced Algebra and Logic #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Rough Sets and Fuzzy Logic #Semantic Web and Ontologies #cs.LO
paper · pdf · doi:10.48550/arxiv.1307.7661
KSE 2013 conference
openalex publication_date 2013/07/29 · arxiv created 2013/07/30 · arxiv updated 2013/07/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The paper introduces a propositional linguistic logic that serves as the basis for automated uncertain reasoning with linguistic information. First, we build a linguistic logic system with truth value domain based on a linear symmetrical hedge algebra. Then, we consider Gödel's t-norm and t-conorm to define the logical connectives for our logic. Next, we present a resolution inference rule, in which two clauses having contradictory linguistic truth values can be resolved. We also give the concept of reliability in order to capture the approximative nature of the resolution inference rule. Finally, we propose a resolution procedure with the maximal reliability.