2,101 research outputs found

    Resolution in Linguistic Propositional Logic based on Linear Symmetrical Hedge Algebra

    Full text link
    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\"{o}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.Comment: KSE 2013 conferenc

    The problem of artificial precision in theories of vagueness: a note on the role of maximal consistency

    Get PDF
    The problem of artificial precision is a major objection to any theory of vagueness based on real numbers as degrees of truth. Suppose you are willing to admit that, under sufficiently specified circumstances, a predication of "is red" receives a unique, exact number from the real unit interval [0,1]. You should then be committed to explain what is it that determines that value, settling for instance that my coat is red to degree 0.322 rather than 0.321. In this note I revisit the problem in the important case of {\L}ukasiewicz infinite-valued propositional logic that brings to the foreground the role of maximally consistent theories. I argue that the problem of artificial precision, as commonly conceived of in the literature, actually conflates two distinct problems of a very different nature.Comment: 11 pages, 2 table
    corecore