Results 31 to 40 of about 236,217 (313)
Proof Complexity of Propositional Default Logic [PDF]
Archive for Mathematical Logic, 2010 Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic. In this paper we examine these calculi from a proof-complexity perspective.
Beyersdorff, Olaf +4 more
openaire +6 more sources
Formalizing Termination Proofs under Polynomial Quasi-interpretations [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tree, no naive formalization of termination proofs yields a connection to the
Naohi Eguchi
doaj +1 more source
Proof complexity of substructural logics
Annals of Pure and Applied Logic, 2021 34 ...
openaire +3 more sources
Sublogarithmic uniform Boolean proof nets [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel computation: Boolean circuits and proof nets for multiplicative linear logic. Mogbil et. al.
Clément Aubert
doaj +1 more source
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma [PDF]
, 2011 Dickson's Lemma is a simple yet powerful tool widely used in termination proofs, especially when dealing with counters or related data structures. However, most computer scientists do not know how to derive complexity upper bounds from such termination ...
Figueira, Diego +3 more
core +1 more source
Uncurrying for Innermost Termination and Derivational Complexity [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we investigate how this
Aart Middeldorp +2 more
doaj +1 more source
Non-Cooperative Rational Interactive Proofs [PDF]
, 2019 Interactive-proof games model the scenario where an honest party interacts with powerful but strategic provers, to elicit from them the correct answer to a computational question.
Chen, Jing +2 more
core +2 more sources
Separations in Proof Complexity and TFNP [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2022 It is well-known that Resolution proofs can be efficiently simulated by Sherali-Adams (SA) proofs. We show 1, however, that any such simulation needs to exploit huge coefficients: Resolution cannot be efficiently simulated by SA when the coefficients are
Mika Göös +6 more
semanticscholar +1 more source
Trade-Offs in Distributed Interactive Proofs [PDF]
, 2019 The study of interactive proofs in the context of distributed network computing is a novel topic, recently introduced by Kol, Oshman, and Saxena [PODC 2018].
Crescenzi, Pierluigi +2 more
core +2 more sources
Structural Complexity of Rational Interactive Proofs
, 2023 This is the full version of a paper submitted to the Computability in Europe (CiE 2023) conference, with all proofs omitted there. In 2012 P. D. Azar and S. Micali introduced a new model of interactive proofs, called "Rational Interactive Proofs". In this model the prover is neither honest nor malicious, but rational in terms of maximizing his expected
Daniil Musatov, Georgii Potapov
openaire +2 more sources