106 research outputs found
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
Exploring a syntactic notion of modal many-valued logics
We propose a general semantic notion of modal many-valued logic. Then,
we explore the di culties to characterize this notion in a syntactic way and
analyze the existing literature with respect to this frameworkPeer Reviewe
Weighted logics for artificial intelligence : an introductory discussion
International audienceBefore presenting the contents of the special issue, we propose a structured introductory overview of a landscape of the weighted logics (in a general sense) that can be found in the Artificial Intelligence literature, highlighting their fundamental differences and their application areas
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
Some Epistemic Extensions of G\"odel Fuzzy Logic
In this paper, we introduce some epistemic extensions of G\"odel fuzzy logic
whose Kripke-based semantics have fuzzy values for both propositions and
accessibility relations such that soundness and completeness hold. We adopt
belief as our epistemic operator, then survey some fuzzy implications to
justify our semantics for belief is appropriate. We give a fuzzy version of
traditional muddy children problem and apply it to show that axioms of positive
and negative introspections and Truth are not necessarily valid in our basic
epistemic fuzzy models. In the sequel, we propose a derivation system as
a fuzzy version of classical epistemic logic . Next, we establish some other
epistemic-fuzzy derivation systems and which are
extensions of , and prove that all of these derivation systems are sound
and complete with respect to appropriate classes of Kripke-based models
- …