The following pages link to Mjollnir (Q54038):
Displaying 14 items.
- Solving QBF with counterexample guided refinement (Q253964) (← links)
- Complexity-sensitive decision procedures for abstract argumentation (Q490451) (← links)
- An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks (Q1670104) (← links)
- Solving quantified linear arithmetic by counterexample-guided instantiation (Q1688537) (← links)
- Optimal and robust controller synthesis using energy timed automata with uncertainty (Q1996422) (← links)
- Decomposing reach set computations with low-dimensional sets and high-dimensional matrices (extended version) (Q2105418) (← links)
- Refutation-based synthesis in SMT (Q2280222) (← links)
- Definability for model counting (Q2303508) (← links)
- A layered algorithm for quantifier elimination from linear modular constraints (Q2363817) (← links)
- Abstract interpretation of microcontroller code: intervals meet congruences (Q2442953) (← links)
- A Survey of Satisfiability Modulo Theory (Q2830018) (← links)
- Abstraction-Based Algorithm for 2QBF (Q3007686) (← links)
- Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling (Q4629598) (← links)
- Transfer Function Synthesis without Quantifier Elimination (Q5892491) (← links)
