Pages that link to "Item:Q1881219"

The following pages link to On the automatizability of resolution and related propositional proof systems (Q1881219):

Displaying 25 items.

• The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
• Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
• A note on SAT algorithms and proof complexity (Q436581) (← links)
• Mean-payoff games and propositional proofs (Q716324) (← links)
• Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\) (Q835026) (← links)
• Resolution for Max-SAT (Q1028942) (← links)
• Automated theorem proving in temporal logic: \(T\)-resolution (Q1322389) (← links)
• On the automatizability of polynomial calculus (Q1959382) (← links)
• Automated theorem proving by resolution in non-classical logics (Q2385426) (← links)
• A combinatorial characterization of resolution width (Q2475405) (← links)
• Implicit resolution (Q2851676) (← links)
• Automatizability and Simple Stochastic Games (Q3012836) (← links)
• On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
• Logical Closure Properties of Propositional Proof Systems (Q3502657) (← links)
• (Q5092398) (← links)
• Automating Resolution is NP-Hard (Q5133983) (← links)
• Finding the Hardest Formulas for Resolution (Q5154766) (← links)
• Parity Games and Propositional Proofs (Q5169973) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)
• Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5916290) (← links)
• Automating algebraic proof systems is NP-hard (Q6086995) (← links)
• Regular resolution effectively simulates resolution (Q6551714) (← links)
• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
• First-order reasoning and efficient semi-algebraic proofs (Q6614038) (← links)
• Common equivalence and size of forgetting from Horn formulae (Q6661056) (← links)