The following pages link to (Q5503674):
Displaying 8 items.
- On the query complexity of selecting minimal sets for monotone predicates (Q253999) (← links)
- Domain expansion for ASP-programs with external sources (Q254002) (← links)
- SAT race 2015 (Q334795) (← links)
- Modeling and solving staff scheduling with partial weighted maxSAT (Q1730743) (← links)
- Expansion-based QBF solving versus Q-resolution (Q2339467) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- aspeed: Solver scheduling via answer set programming (Q4592974) (← links)
- Combining Answer Set Programming and domain heuristics for solving hard industrial problems (Application Paper) (Q4593048) (← links)
