Constraint Satisfaction Problems with Infinite Templates

Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs over infinite templates can be formulated with templates that are -categorical. We survey examples of such problems in temporal and spatial reasoning, infinite-dimensional algebra, acyclic colorings in graph theory, artificial intelligence, phylogenetic reconstruction in computational biology, and tree descriptions in computational linguistics.

• Type: Conference
• Year: 2008
• Where: DAGSTUHL
• Authors: Manuel Bodirsky
• Keywords: DAGSTUHL 2008, Infinite Domains, Infinite Templates, Non-uniform Constraint Satisfaction, Software Engineering