20 citations · 20 across the 2 of their papers we have counts for
2 papers
cs.AI2011
Tractable Set Constraints
Manuel Bodirsky, Martin Hils, Alex Krimkevich
Many fundamental problems in artificial intelligence, knowledge representation, and verification involve reasoning about sets and relations between sets and can be modeled as set c…
cs.LO2009★ 20 cited
On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
Barnaby Martin, Manuel Bodirsky, Martin Hils
The universal-algebraic approach has proved a powerful tool in the study of the complexity of CSPs. This approach has previously been applied to the study of CSPs with finite or (i…