Skip Navigation



Journal of Logic and Computation Advance Access published online on March 18, 2009
Journal of Logic and Computation, doi:10.1093/logcom/exp013
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Flaminio, T.
Right arrow Articles by Montagna, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2009. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

Models for Many-Valued Probabilistic Reasoning

Tommaso Flaminio and Franco Montagna

Department of Mathematics and Computer Science, University of Siena, Pian dei Matellini 44, 53100 Siena, Italy.
E-mail: flaminio{at}unisi.it; montagna{at}unisi.it

Received 2 October 2008.


  Abstract

In this article, we compare models for many-valued probabilistic reasoning from the point of view of the sets of satisfiable formulas, positive satisfiable formulas, and tautologies. The results arising from this comparison will be used in the final part of the present article to provide results about the computational complexity for the problem of deciding if a formula belongs to one of the previously discussed sets.

Keywords: SMV-algebras; states on MV-algebras; probabilistic Kripke models; PSPACE containment


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.