Abstract
AbstractWe discuss the results of our work on heuristics for generating minimal synthetic tableaux. We present this proof method for classical propositional logic and its implementation in Haskell. Based on mathematical insights and exploratory data analysis we define heuristics that allows building a tableau of optimal or nearly optimal size. The proposed heuristics has been first tested on a data set with over 200,000 short formulas (length 12), then on 900 formulas of length 23. We describe the results of data analysis and examine some tendencies. We also confront our approach with the pigeonhole principle.
Publisher
Springer International Publishing
Reference23 articles.
1. Borwein, J., Bailey, D.: Mathematics by Experiment: Plausible Reasoning in the 21st Century. A K Peters, Ltd., Natick (2004)
2. Buss, S.R.: Polynomial size proofs of the propositional pigeonhole principle. J. Symb. Log. 52(4), 916–927 (1987)
3. Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. J. Symb. Log. 44(1), 36–50 (1979)
4. D’Agostino, M.: Investigations into the complexity of some propositional calculi. Technical Monograph. Oxford University Computing Laboratory, Programming Research Group, November 1990
5. D’Agostino, M.: Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence. J. Log. Lang. Comput. 1, 235–252 (1992)