Input Distance and Lower Bounds for Propositional Resolution Proof Length

Lecture Notes in Computer Science - Germany
doi 10.1007/11499107_21
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Resolution Lower Bounds for Perfect Matching Principles

English

Extracting the Resolution Algorithm From a Completeness Proof for the Propositional Calculus

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity

2016English

Expansion Nets: Proof-Nets for Propositional Classical Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Lower Bounds for the Length of Reset Words in Eulerian Automata

International Journal of Foundations of Computer Science
Computer Science
2013English

Improved Lower Bounds for Tree-Like Resolution Over Linear Inequalities

English

Lower Bounds for the Weak Pigeonhole Principle and Random Formulas Beyond Resolution

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2002English

Minimal Distance of Propositional Models

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2018English

Proof Complexity of Propositional Default Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy