Complexity of Fuzzy Probability Logics

@article{Hjek2001ComplexityOF,
  title={Complexity of Fuzzy Probability Logics},
  author={Petr H{\'a}jek and Sauro Tulipani},
  journal={Fundam. Inform.},
  year={2001},
  volume={45},
  pages={207-213}
}
The satisfiability problem for the logic FP(Ł) (fuzzy probability logic over Łukasiewicz logic) is shown to be NP-complete; satisfiability in FP(ŁΠ) (the same over the logic joining Łukasiewicz and product logic) is shown to be in PSPACE. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

HÁJEK: Reasoning about probabilities using fuzzy logic

  • L. GODO, P. F. ESTEVA
  • Neural Network World
  • 2000
1 Excerpt

GODO: Fuzzy logic and probability

  • P. HÁJEK, L F. ESTEVA
  • In Uncertainty in Artificial Intelligence. Proc…
  • 1995
1 Excerpt

MEGIDO: A logic for reasoning about probabilities

  • R. FAGIN, N.J.Y. HALPERN
  • Information and Computation
  • 1990
2 Excerpts

PAPADIMITRIOU: Probabilistic satisfiability

  • G. GEORGAKOPOULOS, C.H.D. KAVVALIOS
  • J. of Complexity
  • 1988
1 Excerpt

The Ł Π and Ł Π 1 2 logics : two complete fuzzy logics joining Łukasiewicz and product logic

  • J. Y. H ALPERN R. F AGIN, N. M EGIDO

Similar Papers

Loading similar papers…