... cq B ≈ dl Θ ≈ dl ≈ cq Θ cq cq ≈ dl ≈ cq cq cq Θ 3 cq Θ 4 S cq Θ 3 J Θ Θ Θ dl cq cq Θ 3 M Θ Θ Θ dl cq cq Θ 3 dl ≈ dl Θ cq T ≈ ≈ Θ 2 A ≈ Θ Θ cq Θ 2,5 V Θ Θ Θ ≈ Θ Y ≈ dl Θ dl Θ Θdl Θ dl2 Θ dl cq Θ Θ Θ Θ Θ 4 4 H 3 Θ Notations: Θ: ...
The REWERSE Perspective Francois Bry, Jan Maluszynski. 1.4.3 CQ - Programs An extension for dl - programs are cq - programs [ 41 ] , which allow for expressing ( union of ) conjunctive queries ( U ) CQ over description logics in the dl ...
... Cq in U can be uniquely assigned to one component Dl as defined above (w.r.t. the chosen edge vw) as follows: If Cq = Dl for some l, then C q is the component whose vertex vl is assigned to itself; otherwise, Dl is to the left of and ...
... dl % cq2 cq cq Θ 3 cq B Θ Θ cq cq3 cq cq3 Θ 4 S % dl % % cq2 Θ 3 dl3 J Θ Θ Θ dl2 cq2 cq Θ 3 M Θ Θ Θ dl cq cq Θ 3 T % dl % dl Θ cq % Θ 2 A % Θ Θ cq Θ 2.5 V Θ Θ Θ dl % cq2 Θ 3 Y % dl Θ dl Θ Θ Θ Θ 4 H Θ Θ dl Θ Θ Θ Θ 4 dl2 Abbreviations: Θ ...
... DL 1 BA Ausschreibung Testzeit : Sonntag , den 10. 3. 1963 , von 14.00 bis 17.00 MEZ . Betriebsart : Beliebig ( CW und FONE ) . Frequenz : 80 - m - Band . Betriebsabwicklung : Anruf in Telegrafie „ CQ DL " , in Telefonie ,, CQ DL - Test ...
... CQ q in λ(q,O)( c). Thus, due to [Calvanese et al., 2007b, Theorem 29], we derive K |= λ(q,O)( c), as required. Let NoUNAPerfectRef denotes the algorithm that, given in input a DL-LiteR ontology O and a CQ=,b q over O, it returns the ...
... dĽ ' } L ' = L + Cg = Cq = CA CF CA ( 1- αoct ) αocr \ d ( n ) qā ( L ) L dL ( 8.4 ) - nc with Cg 11/6 , cq = 3/2 , c = 102 / 27 - 3/2 and ao = 6 / ( 11 — 2nf / nc ) , being the number of colors , ny that of flavors . The constant of ...
... CQ in GP is satisfied in M and every Boolean CQ in GN is not satisfied in M if and only if T |= CQ(A ∪ GP) ⊆ UCQ(GN). Based on the above lemma, we are able to prove correctness of the algorthm DL+log-SAT. Theorem 1. Let B be a DL+log ...
... CQ answering are respectively Exptime-complete and 2-ExpTime-complete and NP-complete for data complexity. Besides these high complexities, some lightweight DLs have been identified with polynomial complexity for CQ answering. The DL ...
... CQ=s presented in [11]. Then, we consider the DL DL-LiteR: for this logic, we prove the following hardness result. Theorem 6. Answering CQ=s in DL-LiteR is coNP-hard with respect to data complexity. Proof (sketch). The proof is by ...