Pages that link to "Item:Q538318"

The following pages link to Cardinality networks: a theoretical and empirical study (Q538318):

Displaying 16 items.

• Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
• WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
• Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency (Q1685966) (← links)
• \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
• Encoding cardinality constraints using multiway merge selection networks (Q2009191) (← links)
• SAT encodings for pseudo-Boolean constraints together with at-most-one constraints (Q2060735) (← links)
• \textsc{Conjure}: automatic generation of constraint models from problem specifications (Q2163883) (← links)
• On propositional coding techniques for the distinguishability of objects in finite sets (Q2272883) (← links)
• Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
• Sorting networks: to the end and back again (Q2424684) (← links)
• Delegatable Functional Signatures (Q2798783) (← links)
• Writing Declarative Specifications for Clauses (Q2835876) (← links)
• Improving the Normalization of Weight Rules in Answer Set Programs (Q2938492) (← links)
• Propositional SAT Solving (Q3176367) (← links)
• Rewriting optimization statements in answer-set programs (Q5240209) (← links)
• Exact and approximate determination of the Pareto front using minimal correction subsets (Q6164362) (← links)