The following pages link to (Q5503674):
Displaying 50 items.
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- Synchronous counting and computational algorithm design (Q896024) (← links)
- P\(_-\)UNSAT approach of attractor calculation for Boolean gene regulatory networks (Q1642530) (← links)
- maxSAT-based large neighborhood search for high school timetabling (Q1652069) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Causal effect identification in acyclic directed mixed graphs and gated models (Q1678412) (← links)
- A constraint optimization approach to causal discovery from subsampled time series data (Q1678425) (← links)
- Automatically improving constraint models in Savile Row (Q1680696) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- The air traffic controller work-shift scheduling problem in Spain from a multiobjective perspective: a metaheuristic and regular expression-based approach (Q1720962) (← links)
- \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming (Q1730740) (← links)
- Modeling and solving staff scheduling with partial weighted maxSAT (Q1730743) (← links)
- Autark assignments of Horn CNFs (Q1742887) (← links)
- Generalized probabilistic satisfiability (Q1744442) (← links)
- Intra- and interdiagram consistency checking of behavioral multiview models (Q1749133) (← links)
- Conflict-driven answer set solving: from theory to practice (Q1761291) (← links)
- Understanding cutting planes for QBFs (Q1784953) (← links)
- Selecting and covering colored points (Q1801049) (← links)
- Fuzzy relational equations with min-biimplication composition (Q1927264) (← links)
- Modular instantiation schemes (Q1944184) (← links)
- Counterexample-guided inductive synthesis for probabilistic systems (Q1982641) (← links)
- Lower bound techniques for QBF expansion (Q1987510) (← links)
- Computation of the transient in max-plus linear systems via SMT-solving (Q1996024) (← links)
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869) (← links)
- \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT (Q2009185) (← links)
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system (Q2022307) (← links)
- \textit{Branch} \& \textit{Memorize} exact algorithms for sequencing problems: efficient embedding of memorization into search trees (Q2027052) (← links)
- Building strategies into QBF proofs (Q2031411) (← links)
- Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- The opacity of backbones (Q2051797) (← links)
- Generalized completeness for SOS resolution and its application to a new notion of relevance (Q2055868) (← links)
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints (Q2060735) (← links)
- Propagation complete encodings of smooth DNNF theories (Q2079276) (← links)
- Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
- Solving bitvectors with MCSAT: explanations from bits and pieces (Q2096440) (← links)
- Scalable algorithms for abduction via enumerative syntax-guided synthesis (Q2096443) (← links)
- A posthumous contribution by Larry Wos: excerpts from an unpublished column (Q2102925) (← links)
- Theorem proving as constraint solving with coherent logic (Q2102932) (← links)
- An efficient subsumption test pipeline for BS(LRA) clauses (Q2104505) (← links)
- Semantic relevance (Q2104509) (← links)
- SCL(EQ): SCL for first-order logic with equality (Q2104511) (← links)
- Ranking with multiple reference points: efficient SAT-based learning procedures (Q2108155) (← links)
- On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem (Q2117621) (← links)
- Efficient all-UIP learned clause minimization (Q2118297) (← links)
- Investigating the existence of Costas Latin squares via satisfiability testing (Q2118308) (← links)
