In propositional calculus and proof complexity a propositional proof system (pps), also called a Cook–Reckhow propositional proof system, is system… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Michael Soltys
- 2017

Propositional proof complexity is a field of theoretical computer science which concerns itself with the lengths of formal proofs… (More)

Is this relevant?

2014

2014

Abstract In this paper, we present that the propositional proof system R(lin) (Resolution over Linear Equations) established by… (More)

Is this relevant?

2007

2007

- Grzegorz Herman, Tim Paterson, Michael Soltys
- Fundam. Inform.
- 2007

We introduce a new propositional proof system, which we call H, that allows quantification over permutations. In H we may write… (More)

Is this relevant?

2005

2005

- Steven Perron
- CSL
- 2005

The proof system G0 of the quantified propositional calculus corresponds to NC, and G1 corresponds to P , but no formula-based… (More)

Is this relevant?

2004

2004

- Christian Glaßer, Alan L. Selman, Liyu Zhang
- MFCS
- 2004

We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some… (More)

Is this relevant?

2002

2002

- Zenon Sadowski
- Theor. Comput. Sci.
- 2002

In this paper we develop a connection between optimal propositional proof systems and structural complexity theory-speciically… (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

We call a pseudorandom generator Gn : {0, 1}n → {0, 1}m hard for a propositional proof system P if P can not efficiently prove… (More)

Is this relevant?

Review

1997

Review

1997

- Zenon Sadowski
- FCT
- 1997

Proof Systems for Structured Algebraic Specifications: An Overview p. 19 Average-Case Analysis via Incompressibility p. 38… (More)

Is this relevant?

1996

1996

- Chris Pollett
- Proof Complexity and Feasible Arithmetics
- 1996

In this paper we introduce Gentzen-style quantified propositional proof systems Li for the theories R i 2. We formalize the… (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Matthew Clegg, Jeff Edmonds, Russell Impagliazzo
- STOC
- 1996

A propositional proof system can be viewed as a non-deterministic algorithm for the (co-NP complete) unsatisfiabilit y problem… (More)

Is this relevant?