Unfounded Sets for Disjunctive Hybrid MKNF Knowledge Bases

02/25/2021
by   Spencer Killen, et al.
0

Combining the closed-world reasoning of answer set programming (ASP) with the open-world reasoning of ontologies broadens the space of applications of reasoners. Disjunctive hybrid MKNF knowledge bases succinctly extend ASP and in some cases without increasing the complexity of reasoning tasks. However, in many cases, solver development is lagging behind. As the result, the only known method of solving disjunctive hybrid MKNF knowledge bases is based on guess-and-verify, as formulated by Motik and Rosati in their original work. A main obstacle is understanding how constraint propagation may be performed by a solver, which, in the context of ASP, centers around the computation of unfounded atoms, the atoms that are false given a partial interpretation. In this work, we build towards improving solvers for hybrid MKNF knowledge bases with disjunctive rules: We formalize a notion of unfounded sets for these knowledge bases, identify lower complexity bounds, and demonstrate how we might integrate these developments into a solver. We discuss challenges introduced by ontologies that are not present in the development of solvers for disjunctive logic programs, which warrant some deviations from traditional definitions of unfounded sets. We compare our work with prior definitions of unfounded sets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2017

Well-Founded Operators for Normal Hybrid MKNF Knowledge Bases

Hybrid MKNF knowledge bases have been considered one of the dominant app...
research
12/20/2013

Query Answering in Object Oriented Knowledge Bases in Logic Programming: Description and Challenge for ASP

Research on developing efficient and scalable ASP solvers can substantia...
research
08/05/2022

A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases

The logic of hybrid MKNF (minimal knowledge and negation as failure) is ...
research
05/12/2017

Clingcon: The Next Generation

We present the third generation of the constraint answer set system clin...
research
06/19/2013

Event-Object Reasoning with Curated Knowledge Bases: Deriving Missing Information

The broader goal of our research is to formulate answers to why and how ...
research
05/03/2023

Contextual Reasoning for Scene Generation (Technical Report)

We present a continuation to our previous work, in which we developed th...
research
08/06/2021

Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs

Extending the popular Answer Set Programming (ASP) paradigm by introspec...

Please sign up or login with your details

Forgot password? Click here to reset