Join queries involving many relations pose a severe challenge to today's...
We study the fixed-parameter tractability of the following fundamental
p...
Structural decomposition methods, such as generalized hypertree
decompos...
Extending programming languages with stochastic behaviour such as
probab...
Modern applications combine information from a great variety of sources....
We study the tractability of conjunctive query answering for queries wit...
We investigate the computational complexity of mining guarded clauses fr...
Modern trends in data collection are bringing current mainstream techniq...
Constraint Satisfaction Problems (CSPs) play a central role in many
appl...
Constraint satisfaction problems (CSPs) are an important formal framewor...
Numerous fundamental database and reasoning problems are known to be NP-...
Fractional (hyper-)graph theory is concerned with the specific problems ...
Hypertree decompositions (HDs), as well as the more powerful generalized...
Hypertree decompositions (HDs), as well as the more powerful generalized...
Answering Conjunctive Queries (CQs) and solving Constraint Satisfaction
...