Conjunctive Query Answering Under Existential Rules - Decidability, Complexity, and Algorithms

Abstract

upper and lower joins are then defined similarly to Definition 3.7 (upper and lower join). te l-0 09 25 72 2, v er si on 1 8 Ja n 20 14 3.2. AN OPTIMAL ALGORITHM FOR GBTS 67 Definition 3.26 (Abstract upper/lower join) Let P1 and P2 be two abstract patterns, a link of P2 with P1. The abstract upper (resp. lower) join of P1 (resp. P2) w.r.t. ( ,P2) (resp… (More)

Topics

27 Figures and Tables

Slides referencing similar topics