publication . Preprint . 2010

A Geometric Presentation of Probabilistic Satisfiability

Morales-Luna, Guillermo;
Open Access English
  • Published: 05 Jul 2010
By considering probability distributions over the set of assignments the expected truth values assignment to propositional variables are extended through linear operators, and the expected truth values of the clauses at any given conjunctive form are also extended through linear maps. The probabilistic satisfiability problems are discussed in terms of the introduced linear extensions. The case of multiple truth values is also discussed.
free text keywords: Computer Science - Logic in Computer Science
Download from

[1] Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh, editors. Handbook of Satisfiability, volume 185 of Frontiers in Artificial Intelligence and Applications. IOS Press, 2009.

[2] George Georgakopoulos, Dimitris Kavvadias, and Christos H. Papadimitriou. Probabilistic satisfiability. J. Complex., 4(1):1-11, 1988.

[3] Pierre Hansen, Brigitte Jaumard, and A. D. Parreira. On the relations between probabilistic logic and p-cms. In IJCAI'99, pages 56-63, 1999.

[6] Guilin Qi. Probabilistic inference on three-valued logic. In RSFDGrC'03: Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing, pages 690- 693, Berlin, Heidelberg, 2003. Springer-Verlag.

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue