Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog

Shqiponja Ahmetaj; Magdalena Ortiz; Mantas Šimkus

doi:10.1016/j.artint.2019.103220

ScienceGate Book Chapters

JOURNAL ARTICLE

Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog

Shqiponja Ahmetaj Magdalena Ortiz Mantas Šimkus

Year: 2019 Journal: Artificial Intelligence Vol: 280 Pages: 103220-103220 Publisher: Elsevier BV

DOI: 10.1016/j.artint.2019.103220

Get Full-Text PDF Get Analytical Report

Keywords:

Datalog Conjunctive query Computer science Ontology Query language Negation Description logic Deductive database Theoretical computer science Semantics (computer science) Database theory Class (philosophy) Knowledge representation and reasoning Programming language Information retrieval Artificial intelligence Relational database

Metrics

Cited By

0.77

FWCI (Field Weighted Citation Impact)

Refs

0.79

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Semantic Web and Ontologies

Physical Sciences → Computer Science → Artificial Intelligence

Logic, Reasoning, and Knowledge

Physical Sciences → Computer Science → Artificial Intelligence

Advanced Database Systems and Queries

Physical Sciences → Computer Science → Computer Networks and Communications

Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog

Metrics

Citation History

Topics

Related Documents

Datalog and description logics: Expressive power

Rewritability in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics

Expressive Logics for Coinductive Predicates

Closed Predicates in Description Logics: Results on Combined Complexity

Computing Datalog Rewritings for Disjunctive Datalog Programs and Description Logic Ontologies