Pages that link to "Item:Q1332641"
From MaRDI portal
The following pages link to Tractability through symmetries in propositional calculus (Q1332641):
Displaying 15 items.
- Tractability of cut-free Gentzen type propositional calculus with permutation inference (Q672046) (← links)
- Short proofs for tricky formulas (Q800909) (← links)
- Predicting and detecting symmetries in FOL finite model search (Q861703) (← links)
- Symmetric blocking (Q897931) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- On the decision trees with symmetries (Q1625180) (← links)
- Local and global symmetry breaking in itemset mining (Q2398272) (← links)
- How to find symmetries hidden in combinatorial problems (Q2751534) (← links)
- Dealing with Symmetries in Modal Tableaux (Q2851930) (← links)
- CSymLean: A Theorem Prover for the Logic CSL over Symmetric Minspaces (Q3010357) (← links)
- Local Symmetry Breaking During Search in CSPs (Q3523057) (← links)
- Ground resolution with group computations on semantic symmetries (Q4647542) (← links)
- SYMMETRIES IN MODAL LOGICS (Q5346685) (← links)
- An adaptive prefix-assignment technique for symmetry reduction (Q5919303) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)