The expected complexity of analytic tableaux analyses in propositional calculus. II
type: Item
instance of: scholarly article
title: The expected complexity of analytic tableaux analyses in propositional calculus. II
zbMATH Open document ID: 0865.03031
DOI: 10.1007/BF01531029
author: John W. Rosenthal
published in: Annals of Mathematics and Artificial Intelligence
publication date: 1997-05-13T00:00:00Z
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03F20
Mathematics Subject Classification ID: 03B05
zbMATH DE Number: 1005827
zbMATH Keywords: satisfiability
zbMATH Keywords: complexity
zbMATH Keywords: analytic tableaux algorithm for SAT
zbMATH Keywords: truth tables
MaRDI profile type: Publication
cites work: Asymptotic Methods in Enumeration
cites work: An Average Time Analysis of Backtracking
cites work: Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem
cites work: Q3827800
cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
cites work: Correction to ``Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem''
cites work: Average time analyses of simplified Davis-Putnam procedures
cites work: Corrigendum to ``Average time analyses of simplified Davis-Putnam procedures''
cites work: Stirling numbers of the second kind
cites work: The expected complexity of analytic tableaux analyses in propositional calculus
cites work: The probability of pure literals
cites work: An Analysis of Backtracking with Search Rearrangement
cites work: Q5589310
cites work: Q5560258
full work available at URL: https://doi.org/10.1007/bf01531029
OpenAlex ID: W2025957619
Recommended article: The proof complexity of analytic and clausal tableaux
Recommended article: The complexity of analytic tableaux
Recommended article: Q4934563
Recommended article: Q5457670
Recommended article: Q5457669
Recommended article: Analytic Tableaux for Higher-Order Logic with Choice
Recommended article: Analytic tableaux for higher-order logic with choice
Recommended article: Q3567772
Recommended article: The Computational Complexity of Propositional Cirquent Calculus
description: scientific article; zbMATH DE number 1005827