Author of the publication

The Limits of Efficiency for Open- and Closed-World Query Evaluation Under Guarded TGDs.

, , , , and . PODS, page 259-270. ACM, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Looking Algebraically at Tractable Quantified Boolean Formulas., and . SAT, (2004)Learnability of Relatively Quantified Generalized Formulas., , and . ALT, volume 3244 of Lecture Notes in Computer Science, page 365-379. Springer, (2004)Learnability of quantified formulas., and . Theor. Comput. Sci., 306 (1-3): 485-511 (2003)A Combinatorial Characterization of Resolution Width, and . Electron. Colloquium Comput. Complex., (2002)Towards a Characterization of Constant-Factor Approximable Min CSPs., , and . SODA, page 847-857. SIAM, (2015)Dismantlability, Connectedness, and Mixing in Relational Structures., , , and . ICALP, volume 132 of LIPIcs, page 29:1-29:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)When Do Homomorphism Counts Help in Query Algorithms?, , , and . ICDT, volume 290 of LIPIcs, page 8:1-8:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Right-Adjoints for Datalog Programs., , and . ICDT, volume 290 of LIPIcs, page 10:1-10:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Arc consistency and friends., , and . J. Log. Comput., 23 (1): 87-108 (2013)A Simple Algorithm for Mal'tsev Constraints., and . SIAM J. Comput., 36 (1): 16-27 (2006)