Titlebook: Web Reasoning and Rule Systems; 10th International C Magdalena Ortiz,Stefan Schlobach Conference proceedings 2016 Springer International Pu

污穢

bronchodilator

漂泊

Query Rewriting under Linear , Knowledge Bases,ueries. In this paper we exploit such capabilities to answer conjunctive queries (CQs) under ontologies expressed in the description logic called . ., a restricted form of .. In particular, we show a query answering algorithm that rewrites a given CQ into a conjunctive regular path query (CRPQ) whic

邪惡的你

妨礙

essential-fats

On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules,le most work in the area focuses on conjunctive queries, navigational queries are gaining increasing attention. In this paper, we investigate the complexity of evaluating the standard form of navigational queries, namely two-way regular path queries, over knowledge bases whose ontology is expressed

chemical-peel

Negative Knowledge for Certain Query Answers,answers, and miss negative knowledge, which can be useful for two reasons. First, sometimes it is the only type of knowledge one can infer with certainty, and second, it may help one find good and efficient approximations of positive certain answers. Our goal is to consider a framework for defining

GLARE

慷慨援助

SPASM

Extending Weakly-Sticky Datalog,: Query-Answering Tractability and Optimizations,. programs has been investigated, but there is still much work to do on the design and implementation of practical query answering (QA) algorithms and their optimizations. Here, we study sticky and . programs from the point of view of the behavior of the chase procedure, extending the stickiness pro