The following pages link to Computer Science Logic (Q5394580):
Displaying 10 items.
- Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
- The complexity of problems for quantified constraints (Q1959381) (← links)
- How many variables are needed to express an existential positive query? (Q2322719) (← links)
- Learning intersection-closed classes with signatures (Q2381578) (← links)
- Bounded-width QBF is PSPACE-complete (Q2453562) (← links)
- Quantified Constraint Satisfaction and the Polynomially Generated Powers Property (Q3519502) (← links)
- Tree-Width for First Order Formulae (Q3644741) (← links)
- Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas (Q3655211) (← links)
- Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
- Decomposing Quantified Conjunctive (or Disjunctive) Formulas (Q5506695) (← links)
