5 citations · 6 across the 7 of their papers we have counts for
7 papers
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
Marco Bressan, Matthias Lanzinger, Marc Roth
We study the fixed-parameter tractability of the following fundamental problem: given two directed graphs and , count the number of copies of in .…
Incremental Updates of Generalized Hypertree Decompositions
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo +1
Structural decomposition methods, such as generalized hypertree decompositions, have been successfully used for solving constraint satisfaction problems (CSPs). As decompositions c…
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations
Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob
Modern applications combine information from a great variety of sources. Oftentimes, some of these sources, like Machine-Learning systems, are not strictly binary but associated wi…
On the Complexity of Inductively Learning Guarded Rules
Andrei Draghici, Georg Gottlob, Matthias Lanzinger
We investigate the computational complexity of mining guarded clauses from clausal datasets through the framework of inductive logic programming (ILP). We show that learning guarde…
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo +2
Constraint Satisfaction Problems (CSPs) play a central role in many applications in Artificial Intelligence and Operations Research. In general, solving CSPs is NP-complete. The st…
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems
Hubie Chen, Georg Gottlob, Matthias Lanzinger +1
Constraint satisfaction problems (CSPs) are an important formal framework for the uniform treatment of various prominent AI tasks, e.g., coloring or scheduling problems. Solving CS…