The following pages link to (Q5503674):
Displaying 50 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Domain expansion for ASP-programs with external sources (Q254002) (← links)
- Backdoors to q-Horn (Q261394) (← links)
- Extracting unsatisfiable cores for LTL via temporal resolution (Q266863) (← links)
- Quantified maximum satisfiability (Q272016) (← links)
- Portfolio approaches for constraint optimization problems (Q276552) (← links)
- ASlib: a benchmark library for algorithm selection (Q286390) (← links)
- The QBF Gallery: behind the scenes (Q286397) (← links)
- Labelled interpolation systems for hyper-resolution, clausal, and local proofs (Q286731) (← links)
- Adding decision procedures to SMT solvers using axioms with triggers (Q287384) (← links)
- Learning general constraints in CSP (Q309921) (← links)
- Augmenting measure sensitivity to detect essential, dispensable and highly incompatible features in mass customization (Q320841) (← links)
- On a class of decision diagrams (Q329079) (← links)
- SAT race 2015 (Q334795) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- A satisfiability algorithm and average-case hardness for formulas over the full binary basis (Q354655) (← links)
- Planning as satisfiability: heuristics (Q359984) (← links)
- On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124) (← links)
- On the van der Waerden numbers \(\mathrm{w}(2; 3, t)\) (Q400514) (← links)
- Polynomial graph transformability (Q418788) (← links)
- Learning from conflicts in propositional satisfiability (Q427560) (← links)
- A finite state intersection approach to propositional satisfiability (Q442157) (← links)
- Computational approaches to finding and measuring inconsistency in arbitrary knowledge bases (Q459042) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- Program verification using symbolic game semantics (Q477213) (← links)
- Enhancing unsatisfiable cores for LTL with information on temporal relevance (Q507378) (← links)
- Two approximate algorithms for model counting (Q507433) (← links)
- Introduction to the special issue on combining constraint solving with mining and learning (Q511749) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Structured learning modulo theories (Q511777) (← links)
- Dealing with 4-variables by resolution: an improved MaxSAT algorithm (Q515546) (← links)
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063) (← links)
- Constraint-based analysis of concurrent probabilistic hybrid systems: an application to networked automation systems (Q547916) (← links)
- Autonomous operator management for evolutionary algorithms (Q604944) (← links)
- Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL (Q606999) (← links)
- Formal reliability analysis of redundancy architectures (Q667523) (← links)
- Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696) (← links)
- Engineering constraint solvers for automatic analysis of probabilistic hybrid automata (Q710668) (← links)
- SAT-based models for overlapping community detection in networks (Q783048) (← links)
- On quasi-inconsistency and its complexity (Q785227) (← links)
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
- Restart strategies in a continuous setting (Q825972) (← links)
- An improved generator for 3-CNF formulas (Q827897) (← links)
- Optimization modulo non-linear arithmetic via incremental linearization (Q831943) (← links)
- Enforcing almost-sure reachability in POMDPs (Q832296) (← links)
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs (Q832719) (← links)
