Matthias Lanzinger

Publication Activity (10 Years)

Years Active: 2018-2024
Publications (10 Years): 44

Top Topics

Hypertree Decomposition

Query Answering

Extended Abstract

Constraint Satisfaction

Top Venues

Publications

Matthias Lanzinger, Pablo Barceló
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters. ICLR (2024)
Matthias Lanzinger, Igor Razgon
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. STACS (2024)
Matthias Lanzinger, Stefano Sferrazza, Przemyslaw Andrzej Walega, Georg Gottlob
Fuzzy Datalog∃ over Arbitrary t-Norms. LPAR (2024)
Matthias Lanzinger, Reinhard Pichler, Alexander Selzer
Avoiding Materialisation for Guarded Aggregate Queries. CoRR (2024)
Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. ACM Trans. Database Syst. 49 (1) (2024)
Matthias Lanzinger, Stefano Sferrazza, Przemyslaw Andrzej Walega, Georg Gottlob
over Arbitrary t-Norms. CoRR (2024)
Emily Jin, Michael Bronstein, Ismail Ilkan Ceylan, Matthias Lanzinger
Homomorphism Counts for Graph Neural Networks: All About That Basis. CoRR (2024)
Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
Fractional covers of hypergraphs with bounded multi-intersection. Theor. Comput. Sci. 979 (2023)
Matthias Lanzinger, Pablo Barceló
On the Power of the Weisfeiler-Leman Test for Graph Motif Parameters. CoRR (2023)
Matthias Lanzinger
-acyclicity for conjunctive queries with negation and SAT. Theor. Comput. Sci. 942 (2023)
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer
Reaching Back to Move Forward: Using Old Ideas to Achieve a New Level of Query Optimization (short paper). AMW (2023)
Marco Bressan, Matthias Lanzinger, Marc Roth
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. STOC (2023)
Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob
MV-Datalog+/-: Effective Rule-based Reasoning with Uncertain Observations (Extended Abstract). IJCAI (2023)
Matthias Lanzinger, Igor Razgon
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs. CoRR (2023)
Matthias Lanzinger, Markus Nissl, Emanuel Sallinger, Przemyslaw Andrzej Walega
Temporal Datalog with Existential Quantification. IJCAI (2023)
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler, Alexander Selzer
Structure-Guided Query Evaluation: Towards Bridging the Gap from Theory to Practice. CoRR (2023)
Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris
Generative Datalog with Stable Negation. PODS (2023)
Marco Bressan, Matthias Lanzinger, Marc Roth
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree. CoRR (2022)
Andrei Draghici, Georg Gottlob, Matthias Lanzinger
On the Complexity of Inductively Learning Guarded Clauses. AAAI (2022)
Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob
New Perspectives for Fuzzy Datalog (Extended Abstract). Datalog (2022)
Matthias Lanzinger
The Complexity of Conjunctive Queries with Degree 2. PODS (2022)
Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. PODS (2022)
Marta Bernardini, Matthias Lanzinger, Rosario Laurendi, Stefano Sferrazza
Family Link Detection in Uncertain Settings with MV-Datalog±. EDBT/ICDT Workshops (2022)
Matthias Lanzinger, Przemyslaw Andrzej Walega
Datalog with Existential Quantifiers and Temporal Operators (Extended Abstract). Datalog (2022)
Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris
Generative Datalog with Stable Negation. CoRR (2022)
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus
Incremental Updates of Generalized Hypertree Decompositions. ACM J. Exp. Algorithmics 27 (2022)
Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations. CoRR (2022)
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus
Incremental Updates of Generalized Hypertree Decompositions. CoRR (2022)
Matthias Lanzinger, Stefano Sferrazza, Georg Gottlob
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations. Theory Pract. Log. Program. 22 (5) (2022)
Matthias Lanzinger
Forbidden Substructures for Tractable Conjunctive Query Answering with Degree 2. CoRR (2021)
Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler
Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth. CoRR (2021)
Matthias Lanzinger
Tractability Beyond ß-Acyclicity for Conjunctive Queries with Negation. PODS (2021)
Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
Complexity Analysis of Generalized and Fractional Hypertree Decompositions. J. ACM 68 (5) (2021)
Andrei Draghici, Georg Gottlob, Matthias Lanzinger
On the Complexity of Inductively Learning Guarded Rules. CoRR (2021)
Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. CoRR (2020)
Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
Complexity Analysis of General and Fractional Hypertree Decompositions. CoRR (2020)
Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
Fractional Covers of Hypergraphs with Bounded Multi-Intersection. MFCS (2020)
Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler
Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. IJCAI (2020)
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. CPAIOR (2020)
Georg Gottlob, Matthias Lanzinger, Reinhard Pichler, Igor Razgon
Fractional Covers of Hypergraphs with Bounded Multi-Intersection. CoRR (2020)
Georg Gottlob, Matthias Lanzinger, Davide Mario Longo, Cem Okulmus, Reinhard Pichler
The HyperTrac Project: Recent Progress and Future Research Directions on Hypergraph Decompositions. CoRR (2020)
Matthias Lanzinger
Tractability Beyond β-Acyclicity for Conjunctive Queries with Negation. CoRR (2020)
Georg Gottlob, Matthias Lanzinger, Reinhard Pichler
Semantic Width Revisited (Extended Abstract). AMW (2019)
Georg Gottlob, Matthias Lanzinger, Reinhard Pichler
Semantic Width of Conjunctive Queries and Constraint Satisfaction Problems. CoRR (2018)