Image de couverture de livre

Hard QBFs for Merge Resolution

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Beyersdorff, Olaf, Blinkhorn, Joshua, Mahajan, Meena, Peitl, Tomáš, Sood, Gaurav
Format:	Preprint
Publié:	2020
Sujets:	Computational Complexity Logic in Computer Science 03F20
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Semi-Algebraic Proof Systems for QBF
par: Beyersdorff, Olaf, et autres
Publié: (2025)

QBF Merge Resolution is powerful but unnatural
par: Mahajan, Meena, et autres
Publié: (2022)

A Theory for Probabilistic Polynomial-Time Reasoning
par: Chen, Lijie, et autres
Publié: (2026)

Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
par: Beyersdorff, Olaf, et autres
Publié: (2021)

Proving Unsatisfiability with Hitting Formulas
par: Filmus, Yuval, et autres
Publié: (2023)

Predicative Ordinal Recursion on the Constructive Veblen Hierarchy
par: Tabatabai, Amirhossein Akbar, et autres
Publié: (2025)

From Gödel incompleteness to the consistency of circuit lower bounds
par: Atserias, Albert, et autres
Publié: (2026)

Better Extension Variables in DQBF via Independence
par: Chew, Leroy, et autres
Publié: (2025)

On the existence of strong proof complexity generators
par: Krajicek, Jan
Publié: (2022)

Adversarial Barrier in Uniform Class Separation
par: Rosko, Milan
Publié: (2025)

What If Turing Had Preceded Gödel?
par: Oberhoff, Sebastian
Publié: (2024)

On Godel's treatment of the undecidable in 1931
par: Cattabriga, Paola
Publié: (2024)

On the Interplay of Cube Learning and Dependency Schemes in QCDCL Proof Systems
par: Choudhury, Abhimanyu, et autres
Publié: (2025)

A simplified lower bound for implicational logic
par: Jeřábek, Emil
Publié: (2023)

Intuitionistic Common Knowledge
par: Zenger, Lukas
Publié: (2026)

Deducibility in the full Lambek calculus with weakening is HAck-complete
par: Greati, Vitor, et autres
Publié: (2024)

Hypersequent Calculi Have Ackermannian Complexity
par: Balasubramanian, A. R., et autres
Publié: (2026)

Small unsatisfiable $k$-CNFs with bounded literal occurrence
par: Zhang, Tianwei, et autres
Publié: (2024)

On the Descriptive Complexity of Groups without Abelian Normal Subgroups
par: Grochow, Joshua A., et autres
Publié: (2022)

Punctually Standard and Nonstandard Models of Natural Numbers
par: Bazhenov, Nikolay, et autres
Publié: (2026)

Extended Nullstellensatz proof systems
par: Krajicek, Jan
Publié: (2023)

Proof-theoretic methods in quantifier-free definability
par: Kocsis, Zoltan A.
Publié: (2023)

Hereditary First-Order Logic: the tractable quantifier prefix classes
par: Bodirsky, Manuel, et autres
Publié: (2024)

On the Computational Power of Extensional ESO
par: Bodirsky, Manuel, et autres
Publié: (2025)

A Minimal Substitution Basis for the Kalmár Elementary Functions
par: Prunescu, Mihai, et autres
Publié: (2025)

An ecumenical view of proof-theoretic semantics
par: Nascimento, Victor, et autres
Publié: (2023)

Structure-Guided Automated Reasoning
par: Bannach, Max, et autres
Publié: (2023)

First-Order Fischer Servi Logic
par: Christensen, Ahmee
Publié: (2024)

Hard Clique Formulas for Resolution
par: Atserias, Albert
Publié: (2026)

Computation as a Game
par: Bilokon, Paul Alexander
Publié: (2025)

Glivenko's theorems from an ecumenical perspective
par: Pereira, Luiz Carlos, et autres
Publié: (2026)

A Sequent Calculus Perspective on Base-Extension Semantics (Technical Report)
par: Barroso-Nascimento, Victor, et autres
Publié: (2025)

Nested Sequents for Provability Logic GLP
par: Shamkanov, Daniyar
Publié: (2014)

The Myhill isomorphism theorem does not generalize much
par: Pradic, Cécilia
Publié: (2025)

The Uniform Functional Interpretation with Informative Types
par: Ferreira, Fernando, et autres
Publié: (2025)

Constructive validity of a generalized Kreisel-Putnam rule
par: Pezlar, Ivo
Publié: (2023)

Complexities of Well-Quasi-Ordered Substructural Logics
par: Galatos, Nikolaos, et autres
Publié: (2025)

A proof complexity conjecture and the Incompleteness theorem
par: Krajicek, Jan
Publié: (2023)

Redundancy rules for MaxSAT
par: Bonacina, Ilario, et autres
Publié: (2025)

A propositional cirquent calculus for computability logic
par: Japaridze, Giorgi
Publié: (2024)