Pages that link to "Item:Q3637167"

The following pages link to New Encodings of Pseudo-Boolean Constraints into CNF (Q3637167):

Displaying 17 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)
• SAT encodings for pseudo-Boolean constraints together with at-most-one constraints (Q2060735) (← 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)
• On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving (Q5015594) (← links)
• Rewriting optimization statements in answer-set programs (Q5240209) (← 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)