An expressive and tractable rule-based description language

Abstract

ABSTRACT is a rule language introduced by Nguyen, Nguyen, and Szałas for the Semantic Web. It has a PTime data complexity and is more expressive than Horn- . These rule languages, however, do not allow PDL-like role constructors (i.e., union, sequential composition, the reflexive-transitive closure and the test operator). Using the transitive closure of a role is not the same as using a transitive role that is a superrole of . Furthermore, the test operator together with the other PDL-like role constructors would allow users to express sophisticated concepts. In this paper, we extend with PDL-like role constructors to obtain the rule language . We modify the algorithm given by Nguyen, Nguyen, and Szałas (2015) to obtain another one that checks satisfiability of a knowledge base in instead of . The resulting algorithm also has a PTime data complexity and is therefore tractable.