ScholarLens Back to search
2012•Unpublished venueRequires access

Deciding FO-Rewritability in EL

Meghyn Bienvenu, Carsten Lutz, Frank Wolter

Open publisher page 11 citations

Abstract

Abstract. We consider the problem of deciding, given an instance query A(x), an EL-TBox T, and possibly an ABox signature Σ, whether A(x) is FO-rewritable relative to T and Σ-ABoxes. Our main results are PSPACE-completeness for the case where Σ comprises all symbols and EXPTIME-completeness for the general case. We also show that the problem is in PTIME for classical TBoxes and that every instance query is FO-rewritable into a polynomial-size FO query relative to every (semi)-acyclic TBox (under some mild assumptions on the data). 1

About this research paper

What this paper is about

Abstract. We consider the problem of deciding, given an instance query A(x), an EL-TBox T, and possibly an ABox signature Σ, whether A(x) is FO-rewritable relative to T and Σ-ABoxes. Our main results are PSPACE-completeness for the case where Σ comprises all symbols and EXPTIME-completeness for the general case. We also show that the problem is in PTIME for classical TBoxes and that every instance query is FO-rewritable into a polynomial-size FO query relative to every (semi)-acyclic TBox (under some mild assumptions on the data). 1

Why it matters

OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract. We consider the problem of deciding, given an instance query A(x), an EL-TBox T, and possibly an ABox signature Σ, whether A(x) is FO-rewritable relative to T and Σ-ABoxes. Our main results are PSPACE-completeness for the case where Σ comprises all symbols and EXPTIME-completeness for the general case. We also show that the problem is in PTIME for classical TBoxes and that every instance query is FO-rewritable into a polynomial-size FO query relative to every (semi)-acyclic TBox (under some mild assumptions on the data). 1

Key concepts: P, PSPACE, EXPTIME, Completeness (order theory), Computer science, Signature (topology), Time complexity, Computational complexity theory

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Deciding FO-Rewritability in EL — Research Paper | ScholarLens