Skip to content

Computing Solutions in OWL 2 QL

· 0 citations · 20 references

TL;DR

The problem of exchanging knowledge bases from a source signature to a target signature connected through a mapping connected through a mapping in OWL2QL is studied and a novel technique based on reachability games on graphs is provided to show that the non-emptiness and membership problems are in PTime.

View source

Similar papers

Kent Academic Repository

M. Arenas, Елена Аполлоновна Ботоева, Diego Calvanese et al. · 0 citations
#small language model Preprint Oct 2026

On Knowledge Compilation Languages for QBFs

In this work, we design knowledge compilation languages for quantified Boolean formulas (QBFs), with a particular focus on model counting. We introduce various languages in increasing order of their power of representation, starting from a simple tree-based structure, and extending it to DAGs for a more efficient repre...

S. Chede, V. Krishan, Anil Shukla · 0 citations
Open access Jan 2025

A Common Ancestor of PDL, Conjunctive Queries, and Unary Negation First-order Logic

We introduce and study UCPDL+, a family of expressive logics rooted in Propositional Dynamic Logic (PDL) with converse (CPDL) and universal modality (UCPDL). In terms of expressive power, UCPDL+ strictly contains PDL extended with intersection and converse (a.k.a. ICPDL), as well as Conjunctive Queries (CQ), Conjunctiv...

Diego Figueira, S. Figueira · 3 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.