The following pages link to (Q3429154):
Displayed 50 items.
- An experiment with satisfiability modulo SAT (Q287334) (← links)
- Boolean lexicographic optimization: algorithms \& applications (Q421451) (← links)
- Reformulation based MaxSat robustness (Q487654) (← links)
- Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Cardinality networks: a theoretical and empirical study (Q538318) (← links)
- Haplotype inference with pseudo-Boolean optimization (Q545548) (← links)
- The weighted grammar constraint (Q545550) (← links)
- Haplotyping populations by pure parsimony based on compatible genotypes and greedy heuris\-tics (Q555381) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- Compact and efficient encodings for planning in factored state and action spaces with learned binarized neural network transition models (Q785238) (← links)
- KBO orientability (Q846165) (← links)
- Non existence of some mixed Moore graphs of diameter 2 using SAT (Q898115) (← links)
- Probabilistic satisfiability: algorithms with the presence and absence of a phase transition (Q905995) (← links)
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques (Q941662) (← links)
- An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints (Q968351) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← 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)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← 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)
- Solving a multi-resource partial-ordering flexible variant of the job-shop scheduling problem with hybrid ASP (Q2055805) (← links)
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints (Q2060735) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- OptiLog: a framework for SAT-based systems (Q2118280) (← 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)
- Computing AES related-key differential characteristics with constraint programming (Q2289026) (← links)
- A multiparametric view on answer set programming (Q2317973) (← links)
- On the hardness of solving edge matching puzzles as SAT or CSP problems (Q2342584) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Formal methods for reasoning and uncertainty reduction in evidential grid maps (Q2407931) (← links)
- A Boolean satisfiability approach to the resource-constrained project scheduling problem (Q2430594) (← links)
- A 0-1 integer linear programming approach to schedule outages of nuclear power plants (Q2434323) (← links)
- Complete Boolean satisfiability solving algorithms based on local search (Q2434568) (← links)
- Delegatable Functional Signatures (Q2798783) (← links)
- Mitigating Multi-target Attacks in Hash-Based Signatures (Q2798784) (← links)
- Writing Declarative Specifications for Clauses (Q2835876) (← links)
- DRAT Proofs for XOR Reasoning (Q2835888) (← links)
- Applying Visible Strong Equivalence in Answer-Set Program Transformations (Q2900532) (← 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)
- The Automatic Detection of Token Structures and Invariants Using SAT Checking (Q3303932) (← links)