Pages that link to "Item:Q1408381"
From MaRDI portal
The following pages link to Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381):
Displayed 9 items.
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- Generalizations of matched CNF formulas (Q1777405) (← links)
- Investigations on autark assignments (Q1841885) (← links)
- Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. (Q1853541) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)