The following pages link to Short proofs for tricky formulas (Q800909):
Displaying 31 items.
- The limits of tractability in resolution-based propositional proof systems (Q408157) (← links)
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
- Symmetric blocking (Q897931) (← links)
- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver (Q1037644) (← links)
- Tractability through symmetries in propositional calculus (Q1332641) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- Relative efficiency of propositional proof systems: Resolution vs. cut-free LK (Q1577476) (← links)
- On the decision trees with symmetries (Q1625180) (← links)
- The complexity of resolution with generalized symmetry rules (Q1771316) (← links)
- Testing satisfiability of CNF formulas by computing a stable set of points (Q1777393) (← links)
- The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396) (← links)
- Short proofs for some symmetric quantified Boolean formulas (Q1799597) (← links)
- Mutilated chessboard problem is exponentially hard for resolution (Q1884991) (← links)
- Short resolution proofs for a sequence of tricky formulas (Q1924995) (← links)
- The symmetry rule in propositional logic (Q1961453) (← links)
- Formula simplification via invariance detection by algebraically indexed types (Q2104529) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- Symmetries, almost symmetries, and lazy clause generation (Q2342601) (← links)
- Local and global symmetry breaking in itemset mining (Q2398272) (← links)
- Separation results for the size of constant-depth propositional proofs (Q2566064) (← links)
- The state of SAT (Q2643296) (← links)
- How to find symmetries hidden in combinatorial problems (Q2751534) (← links)
- Regular and General Resolution: An Improved Separation (Q3502715) (← links)
- Local Symmetry Breaking During Search in CSPs (Q3523057) (← links)
- An Exponential Lower Bound for Width-Restricted Clause Learning (Q3637163) (← links)
- Ground resolution with group computations on semantic symmetries (Q4647542) (← links)
- On Linear Resolution (Q5015599) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- Sum of squares bounds for the ordering principle (Q5092489) (← links)
- Exploiting Symmetry in SMT Problems (Q5200027) (← links)
- Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
