research
∙
05/23/2023
Parameterized Complexity Classification for Interval Constraints
Constraint satisfaction problems form a nicely behaved class of problems...
share
research
∙
11/18/2022
Computational Short Cuts in Infinite Domain Constraint Satisfaction
A backdoor in a finite-domain CSP instance is a set of variables where e...
research
∙
11/07/2022
Complexity Classification Transfer for CSPs via Algebraic Products
We study the complexity of infinite-domain constraint satisfaction probl...
research
∙
08/04/2022
Almost Consistent Systems of Linear Equations
Checking whether a system of linear equations is consistent is a basic c...
research
∙
07/03/2021
Solving Infinite-Domain CSPs Using the Patchwork Property
The constraint satisfaction problem (CSP) has important applications in ...
research
∙
05/05/2018
Classification transfer for qualitative reasoning problems
We study formalisms for temporal and spatial reasoning in the modern con...
research
∙
02/21/2017
On the Complexity of CCG Parsing
We study the parsing complexity of Combinatory Categorial Grammar (CCG) ...
research
∙
02/04/2014
A Refined View of Causal Graphs and Component Sizes: SP-Closed Graph Classes and Beyond
The causal graph of a planning instance is an important tool for plannin...
research
∙
01/23/2014
Algorithms and Limits for Compact Plan Representations
Compact representations of objects is a common concept in computer scien...
research
∙
11/02/2012
Parameterized Complexity and Kernel Bounds for Hard Planning Problems
The propositional planning problem is a notoriously difficult computatio...
research
∙
08/13/2012
