Pages that link to "Item:Q3192077"
From MaRDI portal
The following pages link to Detecting Cardinality Constraints in CNF (Q3192077):
Displaying 7 items.
- The configurable SAT solver challenge (CSSC) (Q502389) (← links)
- Tight representation of logical constraints as cardinality rules (Q1300274) (← links)
- Multi-agent path finding with mutex propagation (Q2082515) (← links)
- Stable states of Boolean regulatory networks composed over hexagonal grids (Q2130578) (← links)
- Recognition of Nested Gates in CNF Formulas (Q3453230) (← links)
- (Q4413450) (← links)
- Clausal proofs for pseudo-Boolean reasoning (Q6535573) (← links)