Publicaties
On well-founded set-inductions and locally monotone operators KU Leuven
Groundedness in Logics with a Fixpoint Semantics KU Leuven
Fixpoint Semantics for Recursive SHACL Universiteit Hasselt Vrije Universiteit Brussel
Approximation fixpoint theory and the semantics of logic and answers set programs KU Leuven
Fixpoint semantics for active integrity constraints Vrije Universiteit Brussel KU Leuven
Active integrity constraints (AICs) constitute a formalism to associate with a database not just the constraints it should adhere to, but also how to fix the database in case one or more of these constraints are violated. The intuitions regarding which repairs are “good” given such a description are closely related to intuitions that live in various areas of non-monotonic reasoning, such as logic programming and autoepistemic logic. In this ...
Datalog queries distributing over components Vrije Universiteit Brussel Universiteit Hasselt
We investigate the class D of queries that distribute over components. These are the queries that can be evaluated by taking the union of the query results over the connected components of the database instance. We show that it is undecidable whether a (positive) Datalog program distributes over components. Additionally, we show that connected Datalog (the fragment of Datalog where all rules are connected) provides an effective syntax for ...
Datalog queries distributing over components Vrije Universiteit Brussel Universiteit Hasselt
We investigate the class D of queries that distribute over components. These are the queries that can be evaluated by taking the union of the query results over the connected components of the database instance. We show that it is undecidable whether a (positive) Datalog program distributes over components. Additionally, we show that connected Datalog (the fragment of Datalog where all rules are connected) provides an effective syntax for ...