Pages that link to "Item:Q2741513"
From MaRDI portal
The following pages link to Satisfiable formulas closed under replacement (Q2741513):
Displaying 7 items.
- The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
- Learning to assign degrees of belief in relational domains (Q1009279) (← links)
- Generalizations of matched CNF formulas (Q1777405) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- Community Structure Inspired Algorithms for SAT and #SAT (Q3453228) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)