Computer Science Logic

DOI10.1007/11538363zbMATH Open1136.68517OpenAlexW2479351976MaRDI QIDQ5394580FDOQ5394580

Authors Hubie Chen, Víctor Dalmau 

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Consistency for Quantified Constraint Satisfaction Problems
• Computer Science Logic
• Tractability in constraint satisfaction problems: a survey
• Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
• A Logical Approach to Constraint Satisfaction

Cited in

(13)

• Learning intersection-closed classes with signatures
• Consistency for Quantified Constraint Satisfaction Problems
• Lower bounds for existential pebble games and \(k\)-consistency tests
• The complexity of problems for quantified constraints
• Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
• How many variables are needed to express an existential positive query?
• Tree-Width for First Order Formulae
• Decomposing Quantified Conjunctive (or Disjunctive) Formulas
• Learning to integrate deduction and search in reasoning about quantified Boolean formulas
• Quantified Constraints in Twenty Seventeen
• Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
• Bounded-width QBF is PSPACE-complete
• Quantified constraint satisfaction and the polynomially generated powers property

This page was built for publication: Computer Science Logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5394580)