Computer Science Logic
From MaRDI portal
Publication:5394580
DOI10.1007/11538363zbMath1136.68517OpenAlexW2479351976MaRDI QIDQ5394580
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11538363
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (10)
Learning intersection-closed classes with signatures ⋮ Quantified Constraint Satisfaction and the Polynomially Generated Powers Property ⋮ The complexity of problems for quantified constraints ⋮ Quantified Constraints in Twenty Seventeen ⋮ Bounded-width QBF is PSPACE-complete ⋮ Quantified constraint satisfaction and the polynomially generated powers property ⋮ Decomposing Quantified Conjunctive (or Disjunctive) Formulas ⋮ Tree-Width for First Order Formulae ⋮ How many variables are needed to express an existential positive query? ⋮ Learning to Integrate Deduction and Search in Reasoning about Quantified Boolean Formulas
This page was built for publication: Computer Science Logic
