COCO
1994
Springer
14 years 3 months ago
1994
Springer
We study competing-prover one-round interactive proof systems. We show that one-round proof systems in which the rst prover is trying to convince a veri er to accept and the secon...
STACS
1997
Springer
14 years 3 months ago
1997
Springer
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
STOC
1999
ACM
14 years 3 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
ISMVL
2000
IEEE
14 years 3 months ago
2000
IEEE
We present a uniform relational framework for developing proof systems for theories of manyvaluedness that may have the form of a logical system, of a class of algebra or of an in...
TAMC
2010
Springer
14 years 4 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
ISAAC
2003
Springer
14 years 4 months ago
2003
Springer
This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical ...
COCO
2003
Springer
14 years 4 months ago
2003
Springer
A fruitful connection between algorithm design and proof complexity is the formalization of the ¤¦¥¨§©§ approach to satisfiability testing in terms of tree-like resolution...
SAT
2007
Springer
14 years 5 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...
SAS
2007
Springer
14 years 5 months ago
2007
Springer
We present a framework for inductive definitions in the logic of bunched implications, BI, and formulate two sequent calculus proof systems for inductive reasoning in this framewo...
CSL
2007
Springer
14 years 5 months ago
2007
Springer
A focused proof system provides a normal form to cut-free proofs that structures the application of invertible and non-invertible inference rules. The focused proof system of Andre...