Pith. sign in

REVIEW

First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2011.09836 v1 pith:ETSBBMHX submitted 2020-11-19 cs.AI cs.DB

First Order-Rewritability and Containment of Conjunctive Queries in Horn Description Logics

Meghyn Bienvenu , Peter Hansen , Carsten Lutz , Frank Wolter This is my paper
classification cs.AI cs.DB
keywords queriesconjunctivecontainmentdescriptionexptimealongapartatomic
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We study FO-rewritability of conjunctive queries in the presence of ontologies formulated in a description logic between EL and Horn-SHIF, along with related query containment problems. Apart from providing characterizations, we establish complexity results ranging from ExpTime via NExpTime to 2ExpTime, pointing out several interesting effects. In particular, FO-rewriting is more complex for conjunctive queries than for atomic queries when inverse roles are present, but not otherwise.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.