Pages that link to "Item:Q1408381"
From MaRDI portal
The following pages link to Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381):
Displaying 20 items.
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019) (← links)
- Homomorphisms of conjunctive normal forms. (Q1408387) (← links)
- Autark assignments of Horn CNFs (Q1742887) (← 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)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Redundancy in logic. I: CNF propositional formulae (Q2457681) (← links)
- On Variables with Few Occurrences in Conjunctive Normal Forms (Q3007672) (← links)
- On Improving MUS Extraction Algorithms (Q3007681) (← links)
- A New Bound for 3-Satisfiable Maxsat and Its Algorithmic Application (Q3088277) (← links)
- 2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05 (Q3430941) (← links)
- Computing Maximal Autarkies with Few and Simple Oracle Queries (Q3453219) (← links)
- Community Structure Inspired Algorithms for SAT and #SAT (Q3453228) (← links)
- Present and Future of Practical SAT Solving (Q5504707) (← links)
