Relatively quantified constraint satisfaction

DOI10.1007/s10601-008-9054-zzbMath1191.68625OpenAlexW2012141606MaRDI QIDQ1020500

Manuel Bodirsky, Hubie Chen

Publication date: 29 May 2009

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-008-9054-z

zbMATH Keywords

computational complexityquantified constraint satisfaction

Mathematics Subject Classification ID

Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Quantified Constraint Satisfaction Problem on Semicomplete Digraphs ⋮ Tractability in constraint satisfaction problems: a survey ⋮ Quantified Constraints in Twenty Seventeen ⋮ A complexity perspective on entailment of parameterized linear constraints ⋮ Tractability of quantified temporal constraints to the max

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constraints, consistency and closure
• On the algebraic structure of combinatorial problems
• Complexity Classifications of Boolean Constraint Satisfaction Problems
• A dichotomy theorem for constraint satisfaction problems on a 3-element set
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Closure properties of constraints
• Computer Science Logic
• The complexity of satisfiability problems
• Algorithmic Learning Theory
• A Simple Algorithm for Mal'tsev Constraints
• STACS 2005

This page was built for publication: Relatively quantified constraint satisfaction