Constraint satisfaction problems form a nicely behaved class of problems...
A backdoor in a finite-domain CSP instance is a set of variables where e...
We study the complexity of infinite-domain constraint satisfaction probl...
Checking whether a system of linear equations is consistent is a basic
c...
The constraint satisfaction problem (CSP) has important applications in
...
We study formalisms for temporal and spatial reasoning in the modern con...
We study the parsing complexity of Combinatory Categorial Grammar (CCG) ...
The causal graph of a planning instance is an important tool for plannin...
Compact representations of objects is a common concept in computer scien...
The propositional planning problem is a notoriously difficult computatio...
The early classifications of the computational complexity of planning un...