메뉴 건너뛰기




Volumn 2471, Issue , 2002, Pages 569-583

On the automatizability of resolution and related propositional proof systems

Author keywords

[No Author keywords available]

Indexed keywords

INTERPOLATION; REFLECTION;

EID: 84941154026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45793-3_38     Document Type: Conference Paper
Times cited : (11)

References (30)
  • 2
    • 51249171493 scopus 로고
    • The monotone circuit complexity of boolean functions
    • [2] N. Alon and R.B. Boppana. The monotone circuit complexity of boolean functions. Combinatorica, 7:1–22, 1987.
    • (1987) Combinatorica , vol.7 , pp. 1-22
    • Alon, N.1    Boppana, R.B.2
  • 4
    • 23044525713 scopus 로고    scopus 로고
    • Lower bounds for the weak pigeonhole principle and random formulas beyond resolution
    • A preliminary version appeared in ICALP’01, Lecture Notes in Computer Science 2076, Springer
    • [4] A. Atserias, M. L. Bonet, and J. L. Esteban. Lower bounds for the weak pigeonhole principle and random formulas beyond resolution. Accepted for publication in Information and Computation. A preliminary version appeared in ICALP’01, Lecture Notes in Computer Science 2076, Springer, pages 1005–1016., 2001.
    • (2001) Accepted for Publication in Information and Computation , pp. 1005-1016
    • Atserias, A.1    Bonet, M.L.2    Esteban, J.L.3
  • 7
    • 0000802475 scopus 로고    scopus 로고
    • Short proofs are narrow–resolution made simple
    • [7] E. Ben-Sasson and A. Wigderson. Short proofs are narrow–resolution made simple. J. ACM, 48(2):149–169, 2001.
    • (2001) J. ACM , vol.48 , Issue.2 , pp. 149-169
    • Ben-Sasson, E.1    Wigderson, A.2
  • 10
    • 0035178618 scopus 로고    scopus 로고
    • On the relative complexity of resolution refinements and cutting planes proof systems
    • A preliminary version appeared in FOCS’98
    • M. L. Bonet, J. L. Esteban, N. Galesi, and J. Johansen. On the relative complexity of resolution refinements and cutting planes proof systems. SIAM Journal of Computing, 30(5):1462–1484, 2000. A preliminary version appeared in FOCS’98.
    • (2000) SIAM Journal of Computing , vol.30 , Issue.5 , pp. 1462-1484
    • Bonet, M.L.1    Esteban, J.L.2    Galesi, N.3    Johansen, J.4
  • 11
    • 0038036843 scopus 로고    scopus 로고
    • Optimality of size-width trade-offs for resolution
    • To appear. A preliminary version appeared in FOCS’99
    • M. L. Bonet and N. Galesi. Optimality of size-width trade-offs for resolution. Journal of Computational Complexity, 2001. To appear. A preliminary version appeared in FOCS’99.
    • (2001) Journal of Computational Complexity
    • Bonet, M.L.1    Galesi, N.2
  • 12
    • 0031481402 scopus 로고    scopus 로고
    • Lower bounds for cutting planes proofs with small coefficients
    • A preliminary version appeared in STOC’95
    • M. L. Bonet, T. Pitassi, and R. Raz. Lower bounds for cutting planes proofs with small coefficients. Journal of Symbolic Logic, 62(3):708–728, 1997. A preliminary version appeared in STOC’95.
    • (1997) Journal of Symbolic Logic , vol.62 , Issue.3 , pp. 708-728
    • Bonet, M.L.1    Pitassi, T.2    Raz, R.3
  • 13
    • 0034478771 scopus 로고    scopus 로고
    • On interpolation and automatization for Frege systems
    • A preliminary version appeared in FOCS’97
    • M. L. Bonet, T. Pitassi, and R. Raz. On interpolation and automatization for Frege systems. SIAM Journal of Computing, 29(6):1939–1967, 2000. A preliminary version appeared in FOCS’97.
    • (2000) SIAM Journal of Computing , vol.29 , Issue.6 , pp. 1939-1967
    • Bonet, M.L.1    Pitassi, T.2    Raz, R.3
  • 14
    • 0001601465 scopus 로고
    • The relative efficiency of propositional proof systems
    • [14] S. Cook and R. Reckhow. The relative efficiency of propositional proof systems. Journal of Symbolic Logic, 44:36–50, 1979.
    • (1979) Journal of Symbolic Logic , vol.44 , pp. 36-50
    • Cook, S.1    Reckhow, R.2
  • 15
    • 0032676863 scopus 로고    scopus 로고
    • An exponential lower bound for the size of monotone real circuits
    • [15] S.A. Cook and A. Haken. An exponential lower bound for the size of monotone real circuits. Journal of Computer and System Sciences, 58:326–335, 1999.
    • (1999) Journal of Computer and System Sciences , vol.58 , pp. 326-335
    • Cook, S.A.1    Haken, A.2
  • 18
    • 84881072062 scopus 로고
    • A computing procedure for quantification theory
    • [18] M. Davis and H. Putnam. A computing procedure for quantification theory. J. ACM, 7:201–215, 1960.
    • (1960) J. ACM , vol.7 , pp. 201-215
    • Davis, M.1    Putnam, H.2
  • 21
    • 0009942942 scopus 로고
    • Lower bounds to the size of constant-depth propositional proofs
    • [21] J. Krajícek. Lower bounds to the size of constant-depth propositional proofs. Journal of Symbolic Logic, 39(1):73–86, 1994.
    • (1994) Journal of Symbolic Logic , vol.39 , Issue.1 , pp. 73-86
    • Krajícek, J.1
  • 22
    • 0031478484 scopus 로고    scopus 로고
    • Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
    • [22] J. Krajícek. Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic. Journal of Symbolic Logic, 62:457–486, 1997.
    • (1997) Journal of Symbolic Logic , vol.62 , pp. 457-486
    • Krajícek, J.1
  • 24
    • 0001978209 scopus 로고    scopus 로고
    • Some consequences of cryptographical conjectures for S1 2 and EF
    • [24] J. Krajícek and P. Pudlák. Some consequences of cryptographical conjectures for S1 2 and EF. Information and Computation, 140(1):82–94, 1998.
    • (1998) Information and Computation , vol.140 , Issue.1 , pp. 82-94
    • Krajícek, J.1    Pudlák, P.2
  • 26
    • 0031504901 scopus 로고    scopus 로고
    • Lower bounds for resolution and cutting plane proofs and monotone computations
    • [26] P. Pudlák. Lower bounds for resolution and cutting plane proofs and monotone computations. Journal of Symbolic Logic, 62(3):981–998, 1997.
    • (1997) Journal of Symbolic Logic , vol.62 , Issue.3 , pp. 981-998
    • Pudlák, P.1
  • 27
    • 0001802357 scopus 로고    scopus 로고
    • On the complexity of the propositional calculus
    • Cambridge University Press
    • [27] P. Pudlák. On the complexity of the propositional calculus. In Sets and Proofs, Invited Papers from Logic Colloquium’97, pages 197–218. Cambridge University Press, 1999.
    • (1999) Sets and Proofs, Invited Papers from Logic Colloquium’97 , pp. 197-218
    • Pudlák, P.1
  • 28
    • 84974667191 scopus 로고    scopus 로고
    • On reducibility and symmetry of disjoint NP-pairs
    • Lecture Notes in Computer Science, Springer-Verlag
    • [28] P. Pudlák. On reducibility and symmetry of disjoint NP-pairs. In 26th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, pages 621–632. Springer-Verlag, 2001.
    • (2001) 26th International Symposium on Mathematical Foundations of Computer Science , pp. 621-632
    • Pudlák, P.1
  • 29
    • 0040468448 scopus 로고    scopus 로고
    • Algebraic models of computation and interpolation for algebraic proof systems
    • P.W. Beame and S. R. Buss, editors, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society
    • [29] P. Pudlák and J. Sgall. Algebraic models of computation and interpolation for algebraic proof systems. In P.W. Beame and S. R. Buss, editors, Proof Complexity and Feasible Arithmetic, volume 39 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 279–296. American Mathematical Society, 1998.
    • (1998) Proof Complexity and Feasible Arithmetic , vol.39 , pp. 279-296
    • Pudlák, P.1    Sgall, J.2
  • 30
    • 84956242314 scopus 로고
    • Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic
    • [30] A.A. Razborov. Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic. Izvestiya of the RAN, 59(1):205–227, 1995.
    • (1995) Izvestiya of the RAN , vol.59 , Issue.1 , pp. 205-227
    • Razborov, A.A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.