Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

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

Vinay K. Chaudhri, Stijn Heymans, Michael Wessel, Tran Cao Son

TL;DR

The paper tackles query answering in large, graph-structured object-oriented knowledge bases (OOKBs) expressed in Answer Set Programming (ASP), using KB_Bio_101 as a real-world, large-scale benchmark. It develops an ASP-based formalization for four practical query types—subsumption, describing an individual, comparing classes, and relating individuals—through input programs I(Q) and rule sets R(Q). Key challenges identified include infinite grounding, undecidability in full OOKB reasoning, and grounding efficiency, with discussion on ASP-DL tradeoffs and the need for new grounding strategies. The work positions KB_Bio_101 as a crucial testbed to push ASP solver capabilities and to inspire cross-paradigm approaches that handle graph-structured knowledge and existential constructs at scale.

Abstract

Research on developing efficient and scalable ASP solvers can substantially benefit by the availability of data sets to experiment with. KB_Bio_101 contains knowledge from a biology textbook, has been developed as part of Project Halo, and has recently become available for research use. KB_Bio_101 is one of the largest KBs available in ASP and the reasoning with it is undecidable in general. We give a description of this KB and ASP programs for a suite of queries that have been of practical interest. We explain why these queries pose significant practical challenges for the current ASP solvers.

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

TL;DR

The paper tackles query answering in large, graph-structured object-oriented knowledge bases (OOKBs) expressed in Answer Set Programming (ASP), using KB_Bio_101 as a real-world, large-scale benchmark. It develops an ASP-based formalization for four practical query types—subsumption, describing an individual, comparing classes, and relating individuals—through input programs I(Q) and rule sets R(Q). Key challenges identified include infinite grounding, undecidability in full OOKB reasoning, and grounding efficiency, with discussion on ASP-DL tradeoffs and the need for new grounding strategies. The work positions KB_Bio_101 as a crucial testbed to push ASP solver capabilities and to inspire cross-paradigm approaches that handle graph-structured knowledge and existential constructs at scale.

Abstract

Research on developing efficient and scalable ASP solvers can substantially benefit by the availability of data sets to experiment with. KB_Bio_101 contains knowledge from a biology textbook, has been developed as part of Project Halo, and has recently become available for research use. KB_Bio_101 is one of the largest KBs available in ASP and the reasoning with it is undecidable in general. We give a description of this KB and ASP programs for a suite of queries that have been of practical interest. We explain why these queries pose significant practical challenges for the current ASP solvers.

Paper Structure

This paper contains 12 sections, 3 theorems, 12 equations, 1 figure, 1 table.

Table of Contents

  1. Introduction
  2. Background: Logic Programming and OOKB
  3. Logic Programming
  4. Object-Oriented Knowledge Bases
  5. KB_Bio_101: An OOKB Usage and Some Key Characteristics
  6. Queries in OOKBs
  7. Subsumption Between Classes ($\mathbf{Q_1}$)
  8. Description of an Individual ($\mathbf{Q_2}$)
  9. Comparing between Classes ($\mathbf{ Q_3}$)
  10. Relationship between Individuals ($\mathbf{Q_4}$)
  11. Discussion
  12. Conclusions

Key Result

proposition 1

Let $KB(D)$ be an OOKB. For every two answer sets $M_1$ and $M_2$ of $KB(D)$, every literal in $M_1 \setminus M_2$ has one of the following forms: ( i) $substitute(x, y)$; ( ii) $is\_substituted(x, y)$; or ( iii) $value_e(r, x, y)$.

Figures (1)

  • Figure 1: Example graph for "Eukaryotic-Cell"

Theorems & Definitions (4)

  • definition 1: Value set of an individual
  • proposition 1
  • proposition 2
  • proposition 3