Pages that link to "Item:Q5897193"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2003 (Q5897193):
Displayed 36 items.
- Set constraint model and automated encoding into SAT: application to the social golfer problem (Q256655) (← links)
- Curriculum-based course timetabling with SAT and MaxSAT (Q475170) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- An efficient approach to solving random \(k\)-SAT problems (Q877837) (← links)
- Some computational aspects of DISTANCE SAT (Q877840) (← links)
- Sorting nine inputs requires twenty-five comparisons (Q899586) (← links)
- Weighted positive binary decision diagrams for exact probabilistic inference (Q1678452) (← links)
- WPM3: an (in)complete algorithm for weighted partial MaxSAT (Q1680676) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← 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)
- Multi-agent path finding with mutex propagation (Q2082515) (← links)
- A SAT encoding to compute aperiodic tiling rhythmic canons (Q2170172) (← links)
- On preprocessing for weighted MaxSAT (Q2234104) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Propagation via lazy clause generation (Q2272160) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- On an MCS-based inconsistency measure (Q2374545) (← links)
- A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
- QMaxSATpb: a certified MaxSAT solver (Q2694600) (← links)
- Exploiting Resolution-Based Representations for MaxSAT Solving (Q3453232) (← links)
- GAC Via Unit Propagation (Q3523055) (← links)
- Towards Robust CNF Encodings of Cardinality Constraints (Q3523075) (← links)
- Cardinality Networks and Their Applications (Q3637166) (← links)
- New Encodings of Pseudo-Boolean Constraints into CNF (Q3637167) (← links)
- Boolean satisfiability in quantum compilation (Q4993497) (← links)
- On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving (Q5015594) (← links)
- Hard satisfiable 3-SAT instances via autocorrelation (Q5015598) (← links)
- Learning Optimal Decision Sets and Lists with SAT (Q5026234) (← links)
- Comparing Integer Linear Programming to SAT-Solving for Hard Problems in Computational and Systems Biology (Q5041127) (← links)
- Resizing cardinality constraints for MaxSAT (Q5145443) (← links)
- A lower bound on CNF encodings of the at-most-one constraint (Q5915765) (← links)
- An efficient strategy to construct a better differential on multiple-branch-based designs: application to Orthros (Q6057183) (← links)
- Computing optimal hypertree decompositions with SAT (Q6067037) (← links)
- Exact and approximate determination of the Pareto front using minimal correction subsets (Q6164362) (← links)