Georg Gottlob

Finite Model Reasoning in Hybrid Classes of Existential Rules

2018

Two paradigmatic restrictions that have been studied for ensuring the decidability of query answering under existential rules are guardedness and stickiness. With the aim of consolidating these restrictions, a flexible condition, called tameness, has been …

Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity

2021 · Journal of the ACM

This work investigates the decidability and complexity of database query answering under guarded existential rules with nonmonotonic negation according to the classical stable model semantics. In this setting, existential quantification is interpreted via Skolem functions, …

MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations

2022 · Theory and Practice of Logic Programming

Abstract 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 with some degree of (lack of) confidence in the observation. …