The following pages link to (Q4536400):
Displaying 13 items.
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- The complexity of minimal satisfiability problems (Q1887137) (← links)
- The \texttt{ksmt} calculus is a \(\delta \)-complete decision procedure for non-linear constraints (Q2055849) (← links)
- Evaluating optimised decision procedures for propositional modal \({\mathbf K}_{({\mathbf m})}\) satisfiability (Q2751043) (← links)
- Polynomial threshold reoptimization of generalized satisfiability problems with bounded arity predicates (Q2850118) (← links)
- (Q4353618) (← links)
- (Q4539619) (← links)
- Automata, Languages and Programming (Q5466451) (← links)
- Generalized satisfiability problems via operator assignments (Q5919560) (← links)
