A Characterisation of First-Order Constraint Satisfaction Problems
Publication:5453499
DOI10.2168/LMCS-3(4:6)2007zbMath1131.68098OpenAlexW2165528704MaRDI QIDQ5453499
Cynthia Loten, Benoit Larose, Claude Tardif
Publication date: 1 April 2008
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-3(4:6)2007
Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Decidability of theories and sets of sentences (03B25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (31)
This page was built for publication: A Characterisation of First-Order Constraint Satisfaction Problems