An Algebraic Semantics for Possibilistic Logic

UAI 1995 pp. 27-35

/uai/1995/boldrin1995uai-algebraic/

Abstract

The first contribution of this paper is the presentation of a Pavelka-like formulation of possibilistic logic in which the language is naturally enriched by two connectives which represent negation (¬) and a new type of conjunction (⊗). The space of truth values for this logic is the lattice of possibility functions, that, from an algebraic point of view, forms a quantal. A second contribution comes from the understanding of the new conjunction as the combination of tokens of information coming from different sources, which makes our language "dynamic". A Gentzen calculus is presented, which is proved sound and complete with respect to the given semantics. The problem of truth functionality is discussed in this context.

UAI Semantic Scholar

Cite

Text

Boldrin and Sossai. "An Algebraic Semantics for Possibilistic Logic." Conference on Uncertainty in Artificial Intelligence, 1995.

Markdown

[Boldrin and Sossai. "An Algebraic Semantics for Possibilistic Logic." Conference on Uncertainty in Artificial Intelligence, 1995.](https://mlanthology.org/uai/1995/boldrin1995uai-algebraic/)

BibTeX

@inproceedings{boldrin1995uai-algebraic,
  title     = {{An Algebraic Semantics for Possibilistic Logic}},
  author    = {Boldrin, Luca and Sossai, Claudio},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {1995},
  pages     = {27-35},
  url       = {https://mlanthology.org/uai/1995/boldrin1995uai-algebraic/}
}