This article is
- freely available
On the Predictability of Classical Propositional Logic
Department of Computer Science, University of Sao Paulo, Sao Paulo, 05508-090, Brazil
* Author to whom correspondence should be addressed.
Received: 17 November 2012; in revised form: 13 December 2012 / Accepted: 31 December 2012 / Published: 14 January 2013
Abstract: In this work we provide a statistical form of empirical analysis of classical propositional logic decision methods called SAT solvers. This work is perceived as an empirical counterpart of a theoretical movement, called the enduring scandal of deduction, that opposes considering Boolean Logic as trivial in any sense. For that, we study the predictability of classical logic, which we take to be the distribution of the runtime of its decision process. We present a series of experiments that determines the run distribution of SAT solvers and discover a varying landscape of distributions, following the known existence of a transition of easy-hard-easy cases of propositional formulas. We find clear distributions for the easy areas and the transitions easy-hard and hard-easy. The hard cases are shown to be hard also for the detection of statistical distributions, indicating that several independent processes may be at play in those cases.
Keywords: SAT; SAT solver; phase transition; landscape of distributions
Article StatisticsClick here to load and display the download statistics.
Notes: Multiple requests from the same IP address are counted as one view.
Cite This Article
MDPI and ACS Style
Finger, M.; Reis, P.M. On the Predictability of Classical Propositional Logic. Information 2013, 4, 60-74.
Finger M, Reis PM. On the Predictability of Classical Propositional Logic. Information. 2013; 4(1):60-74.
Finger, Marcelo; Reis, Poliana M. 2013. "On the Predictability of Classical Propositional Logic." Information 4, no. 1: 60-74.