Pages that link to "Item:Q3637167"
From MaRDI portal
The following pages link to New Encodings of Pseudo-Boolean Constraints into CNF (Q3637167):
Displayed 13 items.
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- Constrained pseudo-propositional logic (Q2228353) (← links)
- A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
- Improving the Normalization of Weight Rules in Answer Set Programs (Q2938492) (← links)
- Optimal Base Encodings for Pseudo-Boolean Constraints (Q3000648) (← links)
- BDDs for Pseudo-Boolean Constraints – Revisited (Q3007674) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- PBLib – A Library for Encoding Pseudo-Boolean Constraints into CNF (Q3453205) (← links)
- Shared aggregate sets in answer set programming (Q4559794) (← links)
- (Q5240209) (← links)