The following pages link to The intractability of resolution (Q1071750):
Displaying 50 items.
- Planning as satisfiability: heuristics (Q359984) (← links)
- Relativization makes contradictions harder for resolution (Q386151) (← links)
- Towards NP-P via proof complexity and search (Q408544) (← links)
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- Lifting lower bounds for tree-like proofs (Q475337) (← links)
- On the complexity of cutting-plane proofs (Q580175) (← links)
- Extended clause learning (Q622116) (← links)
- Meta-resolution: An algorithmic formalisation (Q671650) (← links)
- Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
- Functional interpretations of feasibly constructive arithmetic (Q685962) (← links)
- Exponential lower bounds for the pigeonhole principle (Q687506) (← links)
- Cut formulas in propositional logic (Q689298) (← links)
- Extension without cut (Q714731) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- Unrestricted vs restricted cut in a tableau method for Boolean circuits (Q812394) (← links)
- Two party immediate response disputes: Properties and efficiency (Q814510) (← links)
- Group cancellation and resolution (Q817703) (← links)
- On finding short resolution refutations and small unsatisfiable subsets (Q820148) (← links)
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Proof compressions with circuit-structured substitutions (Q843604) (← links)
- Optimal length resolution refutations of difference constraint systems (Q846163) (← links)
- A feasibly constructive lower bound for resolution proofs (Q915457) (← links)
- Resolution proofs of generalized pigeonhole principles (Q920967) (← links)
- A resolution-based decision procedure for \({\mathcal{SHOIQ}}\). (Q928657) (← links)
- On meta complexity of propositional formulas and propositional proofs (Q937212) (← links)
- The design of the zinc modelling language (Q941812) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- A combinatorial characterization of treelike resolution space (Q1014444) (← links)
- Tight rank lower bounds for the Sherali-Adams proof system (Q1019183) (← links)
- Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← links)
- On the relation among answer set solvers (Q1028643) (← links)
- Resolution for Max-SAT (Q1028942) (← links)
- On the Chvátal rank of the pigeonhole principle (Q1029351) (← links)
- Verifying time, memory and communication bounds in systems of reasoning agents (Q1036066) (← links)
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
- Resolution vs. cutting plane solution of inference problems: Some computational experience (Q1100093) (← links)
- Optimizing propositional calculus formulas with regard to questions of deducibility (Q1117918) (← links)
- Unrestricted resolution versus N-resolution (Q1185013) (← links)
- Tseitin's formulas revisited (Q1193906) (← links)
- Complexity of resolution proofs and function introduction (Q1194246) (← links)
- Good degree bounds on Nullstellensatz refutations of the induction principle (Q1276164) (← links)
- On the modelling of search in theorem proving -- towards a theory of strategy analysis (Q1281504) (← links)
- An exponential lower bound for the size of monotone real circuits (Q1288204) (← links)
- Simplification in a satisfiability checker for VLSI applications (Q1312163) (← links)
- A kind of logical compilation for knowledge bases (Q1331921) (← links)
- On the relative merits of path dissolution and the method of analytic tableaux (Q1331929) (← links)
- A lower bound for tree resolution (Q1336637) (← links)
- The complexity of the pigeonhole principle (Q1343166) (← links)
- A proper hierarchy of propositional sequent calculi (Q1350509) (← links)
