Datalog and Constraint Satisfaction with Infinite Templates

DOI10.1007/11672142_53zbMath1136.03314OpenAlexW2949165194MaRDI QIDQ5449838

Victor Dalmau, Manuel Bodirsky

Publication date: 19 March 2008

Published in: STACS 2006 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10230/36351

Mathematics Subject Classification ID

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) Categoricity and completeness of theories (03C35)

Related Items (7)

Maltsev digraphs have a majority polymorphism ⋮ The complexity of equality constraint languages ⋮ Maximal infinite-valued constraint languages ⋮ Unnamed Item ⋮ Peek arc consistency ⋮ Dualities for Constraint Satisfaction Problems ⋮ Constraint Satisfaction Problems with Infinite Templates

Uses Software

• Datalog

This page was built for publication: Datalog and Constraint Satisfaction with Infinite Templates