Skip to main content
×
Home
    • Aa
    • Aa

A DECISION PROCEDURE FOR PROBABILITY CALCULUS WITH APPLICATIONS

  • BRANDEN FITELSON (a1)
Abstract

A decision procedure (PrSAT) for classical (Kolmogorov) probability calculus is presented. This decision procedure is based on an existing decision procedure for the theory of real closed fields, which has recently been implemented in Mathematica. A Mathematica implementation of PrSAT is also described, along with several applications to various non-trivial problems in the probability calculus.

Copyright
Corresponding author
*DEPARTMENT OF PHILOSOPHY, UNIVERSITY OF CALIFORNIA, BERKELEY, BERKELEY, CA 94720, USA. E-mail: branden@fitelson.org
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

S. Basu , R. Pollack , & M. F Roy . (1996). On the combinatorial and algebraic complexity of quantifier elimination. Journal of the ACM, 43, 1002–1045.

C Brown . (2001a). Improved projection for cylindrical algebraic decomposition. Journal of Symbolic Computation, 32, 447–465.

C Brown . (2001b). Simple CAD construction and its applications. Journal of Symbolic Computation, 31, 521–547.

B. Caviness , & J. Johnson , editors. (1998). Quantifier Elimination and Cylindrical Algebraic Decomposition. Vienna: Springer-Verlag.

J. H. Davenport , & J Heintz . (1988). Real quantifier elimination is doubly exponential. Journal of Symbolic Computation, 5, 29–35.

B Fitelson . (1999). The plurality of Bayesian measures of confirmation and the problem of measure sensitivity. Philosophy of Science, 66, S362–S378. Available online from: http://fitelson.org/psa.pdf.

B Fitelson . (2001a). A Bayesian account of independent evidence with applications. Philosophy of Science, 68, S123–S140. Available online from: http://fitelson.org/psa2.pdf.

H Hong . (1992). Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination. In P. Wang , editor (1992). ISSAC ’92: Papers from the International Symposium on Symbolic and Algebraic Computation. New York: Association for Computing Machinery, pp. 177–188.

J Paris . (1995). The Uncertain Reasoner's Companion: A Mathematical Perspective. Cambridge: Cambridge University Press.

D. Schuurmans , & F Southey . (2001). Local search characteristics of incomplete SAT procedures. Artificial Intelligence, 132, 121–150. Available online from: http://dx.doi.org/10.1016/S0004-3702(01)00151-5.

A Strzebonski . (2000b). Solving systems of strict polynomial inequalities. Journal of Symbolic Computation, 29, 471–480.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Review of Symbolic Logic
  • ISSN: 1755-0203
  • EISSN: 1755-0211
  • URL: /core/journals/review-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 15 *
Loading metrics...

Abstract views

Total abstract views: 148 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 26th June 2017. This data will be updated every 24 hours.