Results 11 to 20 of about 156,901 (262)
Proof Complexity of Modal Resolution. [PDF]
J Autom Reason, 2022 AbstractWe investigate the proof complexity of modal resolution systems developed by Nalon and Dixon (J Algorithms 62(3–4):117–134, 2007) and Nalon et al. (in: Automated reasoning with analytic Tableaux and related methods—24th international conference, (TABLEAUX’15), pp 185–200, 2015), which form the basis of modal theorem proving (Nalon et al., in ...
Sigley S, Beyersdorff O.
europepmc +4 more sources
Proofs of Proof-of-Stake with Sublinear Complexity
CoRR, 2022 Popular Ethereum wallets (like MetaMask) entrust centralized infrastructure providers (e.g., Infura) to run the consensus client logic on their behalf. As a result, these wallets are light-weight and high-performant, but come with security risks. A malicious provider can mislead the wallet by faking payments and balances, or censoring transactions.
Agrawal, Shresth +3 more
openaire +5 more sources
Complexity of Semialgebraic Proofs [PDF]
Moscow Mathematical Journal, 2002 Summary: It is a known approach to translate propositional formulas into systems of polynomial inequalities and consider proof systems for the latter. The well-studied proof systems of this type are the Cutting Plane proof system (CP) utilizing linear inequalities and the Lovász-Schrijver calculi (LS) utilizing quadratic inequalities.
Grigoriev, D, Hirsch, E, Pasechnik, D
openaire +7 more sources
On the Proof Complexity of MCSAT [PDF]
CoRR, 2019 SC-square 2019 : Satisfiability Checking and Symbolic Computation 2019 : Proceedings of the 4th SC-Square Workshop co-located with the SIAM Conference on Applied Algebraic Geometry (SIAM AG 2019) : Bern, Switzerland, 10th July 2019 / Edited by John Abbott, Alberto Griggio 4th Workshop on Satisfiability Checking and Symbolic Computation, SC-square, Bern,
Gereon Kremer +2 more
openaire +2 more sources
Parameterized Proof Complexity [PDF]
computational complexity, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stefan S. Dantchev +2 more
openaire +2 more sources
Safe Recursion on Notation into a Light Logic by Levels [PDF]
Electronic Proceedings in Theoretical Computer Science, 2010 We embed Safe Recursion on Notation (SRN) into Light Affine Logic by Levels (LALL), derived from the logic L4. LALL is an intuitionistic deductive system, with a polynomial time cut elimination strategy.
Luca Roversi, Luca Vercelli
doaj +1 more source
Polylogarithmic Cuts in Models of V^0 [PDF]
Logical Methods in Computer Science, 2013 We study initial cuts of models of weak two-sorted Bounded Arithmetics with respect to the strength of their theories and show that these theories are stronger than the original one.
Sebastian Müller
doaj +1 more source
Perfect Matching in Random Graphs is as Hard as Tseitin [PDF]
TheoretiCS, 2022 We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times.
Per Austrin, Kilian Risse
doaj +1 more source
Proof complexity of positive branching programs [PDF]
Logical Methods in Computer ScienceWe investigate the proof complexity of systems based on positive branching programs, i.e. non-deterministic branching programs (NBPs) where, for any 0-transition between two nodes, there is also a 1-transition.
Anupam Das, Avgerinos Delkos
doaj +1 more source
Tractability Frontier of Data Complexity in Team Semantics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We study the data complexity of model-checking for logics with team semantics. For dependence and independence logic, we completely characterize the tractability/intractability frontier of data complexity of both quantifier-free and quantified formulas ...
Arnaud Durand +3 more
doaj +1 more source