Resolution in Linguistic Propositional Logic based on Linear Symmetrical Hedge Algebra

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

Stable Models of Fuzzy Propositional Formulas

Abstract. We introduce the stable model semantics for fuzzy propositional for-mulas, which generalizes both fuzzy propositional logic and the stable model se-mantics of Boolean propositional formulas. Combining the advantages of both for-malisms, the introduced language allows highly configurable default reasoning in-volving fuzzy truth values. We show that several properties of Boolean stable mod-els are naturally extended to this formalism, and discuss how it is related to other approaches to combining fuzzy logic and the stable model semantics.

From fuzzy to annotated semantic web languages

The aim of this chapter is to present a detailed, selfcontained and comprehensive account of the state of the art in representing and reasoning with fuzzy knowledge in Semantic Web Languages such as triple languages RDF/RDFS, conceptual languages of the OWL 2 family and rule languages. We further show how one may generalise them to so-called annotation domains, that cover also e.g. temporal and provenance extensions

A unique decomposition theorem for ordered monoids with applications in process theory

We prove a unique decomposition theorem for a class of ordered commutative monoids. Then, we use our theorem to establish that every weakly normed process definable in ACP \mathalphae with bounded communication can be expressed as the parallel composition of a multiset of weakly normed parallel prime processes in exactly one way

On Absolutely Divergent Series

We show that in the ℵ2-stage countable support iteration of Mathias forcing over a model of CH the complete Boolean algebra generated by absolutely divergent series under eventual dominance is not isomorphic to the completion of P (ω)/fin. This complements Vojtáˇs’ result, that under cf(c) = p the two algebras are isomorphic [15]