An overview of Datalog boundedness

From International Center for Computational Logic

An overview of Datalog boundedness

Talk by Christian Lewe
Datalog boundedness is the property of a Datalog rule set that its recursion depth is independent of the database during query answering. This property is known to be undecidable and has been extensively studied. We give an overview of different perspectives on boundedness and relate boundedness to first-order rewritability. To build a strong intuition for the nature of boundnedness, we define a new fragment of bounded Datalog rule sets and show its place amidst other bounded fragments.

This is a project defence and will be given online via BigBlueButton. To access the room, use one of the following links:

with ZIH-login:

without ZIH-login (i.e. external participants):