Computer Science Logic
From MaRDI portal
Publication:5292625
DOI10.1007/b13224zbMath1116.03314OpenAlexW2623947920MaRDI QIDQ5292625
Andrei A. Krokhin, Andrei A. Bulatov, Ferdinand Börner, Peter G. Jeavons
Publication date: 21 June 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b13224
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (12)
The complexity of constraint satisfaction games and QCSP ⋮ Learning intersection-closed classes with signatures ⋮ Supermodular functions and the complexity of MAX CSP ⋮ Solving quantified constraint satisfaction problems ⋮ First-Order Model Checking Problems Parameterized by the Model ⋮ The complexity of problems for quantified constraints ⋮ Quantified constraint satisfaction and the polynomially generated powers property ⋮ Recognizing frozen variables in constraint satisfaction problems ⋮ Constraint Satisfaction with Counting Quantifiers ⋮ Relatively quantified constraint satisfaction ⋮ Non-binary quantified CSP: Algorithms and modelling ⋮ Basics of Galois Connections
This page was built for publication: Computer Science Logic
