A modal logic for fusing partial belief of multiple reasoners

Boldrin, Luca

doi:10.1093/logcom/9.1.81

Cited by 13 publications

(9 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There have been some previous works on the development of axiomatic or Gentzen-style calculi for information fusion. For example, in [4][5][6][7], logics for information fusion based on possibility theory are proposed. The Hilbert-style or Gentzen-style proof systems of those logics are also presented.…”

Section: Discussionmentioning

confidence: 99%

“…The Hilbert-style or Gentzen-style proof systems of those logics are also presented. In particular, the logic PL ⊗ n in [4] is an extension of QML in [29][30][31] with distributed belief operator, so the fusion operator in PL ⊗ n is different than the merging operators used in this paper. The axiomatic system and theorem prover for a majority fusion logic M F have also been developed in [13,14].…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Epistemic Logics for Information Fusion

Liau

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we propose some extensions of epistemic logic for reasoning about information fusion. The fusion operators considered in this paper include majority merging, arbitration, and general merging. Some modalities corresponding to these fusion operators are added to epistemic logics and the Kripke semantics of these extended logics are presented. While most existing approaches treat information fusion operators as meta-level constructs, these operators are directly incorporated into our object logic language. Thus it is possible to reason about not only the merged results but also the fusion process in our logics.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

Epistemic Logics for Information Fusion

Liau

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We can leave to the reader the task of checking this example following section 3.3. of (Boldrin and Saffiotti, 1999).…”

Section: Proofmentioning

confidence: 95%

Frontiers of Evolutionary Computation

Menon¹

2004

Genetic Algorithms and Evolutionary Computation

View full text Add to dashboard Cite

Noisy Optimization with Evolution Strategies, Dirk V. Arnold ISBN: 1 -4020-7105-1 Classical and Evolutionary Algorithms in the Optimization of Optical Systems, Darko ISBN: 1-4020-7140-X Evolutionary Algorithms for Embedded System Design, edited by Rolf Drechsler, Nicole Drechsler: ISBN: 1-4020-7276-7Genetic Algorithms and Evolutionary Computation publishes research monographs, edited collections, and graduate-level texts in this rapidly growing field. Primary areas of coverage include the theory, implementation, and application of genetic algorithms (GAs), evolution strategies (ESs), evolutionary programming (EP), learning classifier systems (LCSs) and other variants of genetic and evolutionary computation (GEC). Proposals in related fields such as artificial life, adaptive behavior, artificial immune systems, agent-based systems, neural computing, fuzzy systems, and quantum computing will be considered for publication in this series as long as GEC techniques are part of or inspiration for the system being described. Manuscripts describing GEC applications in all areas of engineering, commerce, the sciences, and the humanities are encouraged.

show abstract

“…The second class is the one of non-truth-functional logics; in particular, this class contains logics based on plausibility measures [Hohle 1995], e.g. possibilistic, probabilistic or belief-function based logics (see, for instance, [Dubois et al 1994], [Fagin and Halpern 1994], [Saffiotti 1995]). The modal flavor of this kind of logics, which has been evidenced by the explicit use of modal operators in [Hajek 1994a] and [Voorbraak 1993] is now clear.…”

Section: Introductionmentioning

confidence: 99%

“…Links to classical epistemic logics have been established in [Liau, Lin 1995], [Murai et al 1993], [Boldrin and Saffiotti 1995].…”

Section: Introductionmentioning

confidence: 99%

Local possibilistic logic

Boldrin¹,

Sossai²

1997

Journal of Applied Non-Classical Logics

View full text Add to dashboard Cite

ABSTRAcr. Possibilistic states of information are fuzzy sets of possible worlds. They constitute a complete lattice, which can be endowed with a monoidal operation (at-norm) to produce a quanta/. An algebraic semantics is presented which links possibilistic formulae with information states, and gives a natural interpretation of logical connectives as operations on fuzzy sets. Due to the quanta/ structure of information states, we obtain a system which shares several features with (exponential-free) intuitionistic linear logic. Soundness and completeness are proved, parametrically on the choice of the t-norm operation.

show abstract

A modal logic for fusing partial belief of multiple reasoners

Cited by 13 publications

References 0 publications

Epistemic Logics for Information Fusion

Epistemic Logics for Information Fusion

Frontiers of Evolutionary Computation

Local possibilistic logic

Contact Info

Product

Resources

About