Pages that link to "Item:Q3143578"
From MaRDI portal
The following pages link to A New Look at BDDs for Pseudo-Boolean Constraints (Q3143578):
Displaying 15 items.
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- Non-clausal redundancy properties (Q2055860) (← links)
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints (Q2060735) (← links)
- Coupling different integer encodings for SAT (Q2170178) (← links)
- Improving the Normalization of Weight Rules in Answer Set Programs (Q2938492) (← links)
- Propositional SAT Solving (Q3176367) (← links)
- (Q4417941) (← links)
- Shared aggregate sets in answer set programming (Q4559794) (← links)
- A Theoretical and Numerical Analysis of the Worst-Case Size of Reduced Ordered Binary Decision Diagrams (Q4617985) (← links)
- Boosting Answer Set Optimization with Weighted Comparator Networks (Q4957202) (← links)
- (Q5146738) (← links)
- Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints (Q6154177) (← links)
- Exact and approximate determination of the Pareto front using minimal correction subsets (Q6164362) (← links)
- Clausal proofs for pseudo-Boolean reasoning (Q6535573) (← links)
- Fast enumeration of all cost-bounded solutions for combinatorial problems using ZDDs (Q6648288) (← links)
