For a fixed finite set of finite tournaments ℱ, the ℱ-free orientation p...
We show that the problem of deciding for a given finite relation algebra...
We study the complexity of infinite-domain constraint satisfaction probl...
We find an orientation of a tree with 20 vertices such that the correspo...
The finite models of a universal sentence Φ in a finite relational
signa...
Predicate logic is the premier choice for specifying classes of relation...
A temporal constraint language is a set of relations that are first-orde...
The finite models of a universal sentence Φ are the age of a structure
i...
The constraint satisfaction problem (CSP) of a first-order theory T is t...
For a first-order theory T, the Constraint Satisfaction Problem of T is
...
We characterise the sentences in Monadic Second-order Logic (MSO) that a...
Robin Hirsch posed in 1996 the Really Big Complexity Problem: classify t...
The algebraic dichotomy conjecture for Constraint Satisfaction Problems
...
Many combinatorial optimisation problems can be modelled as valued const...
Finite-domain constraint satisfaction problems are either solvable by
Da...
Amalgamation SNP (ASNP) is a fragment of existential second-order logic ...
Amalgamation monotone SNP (AMSNP) is a fragment of existential second-or...
Valued constraint satisfaction problems (VCSPs) are a large class of
com...
We study the computational complexity of the general network satisfactio...
The algebraic dichotomy conjecture for Constraint Satisfaction Problems
...
The algebraic dichotomy conjecture for Constraint Satisfaction Problems
...
One of the traditional applications of relation algebras is to provide a...
A subset of Q^n is called semilinear (or piecewise linear) if it is Bool...
We study the Constraint Satisfaction Problem CSP(A), where A is first-or...
We study formalisms for temporal and spatial reasoning in the modern con...
Valued constraint satisfaction problems (VCSPs) are a large class of
com...
The logic MMSNP is a restricted fragment of existential second-order log...
The CSP of a first-order theory T is the problem of deciding for a given...
A constraint satisfaction problem (CSP) is a computational problem where...
Many fundamental problems in artificial intelligence, knowledge
represen...
The universal-algebraic approach has proved a powerful tool in the study...