Pages that link to "Item:Q1961453"
From MaRDI portal
The following pages link to The symmetry rule in propositional logic (Q1961453):
Displaying 16 items.
- Short proofs for tricky formulas (Q800909) (← links)
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← 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)
- 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)
- The state of SAT (Q2643296) (← links)
- How to find symmetries hidden in combinatorial problems (Q2751534) (← links)
- On the symmetry of logic (Q3127683) (← links)
- A Logical Autobiography (Q5027230) (← links)
- A Study of Symmetry Breaking Predicates and Model Counting (Q5039506) (← links)
- Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)