The extension-based inference algorithm for pD*

摘要: In this work, we present a scalable rule-based reasoning algorithm for the OWL pD* language. This uses partial materialization and syntactic ontology transformation (the extension-based knowledge model) to provide fast inference. Because materialized part of does not contain assertional data, time consumed by process, number inferred triples, remain fixed with varying amounts data. The database query rewriting technique handle remaining model prevent expected decreases in performances, which are natural result online during time. work also evaluates efficiency proposed method conducting experiments using LUBM UOBM benchmarks.