From post

Finding ALL Answers to OBDA Queries Using Referring Expressions.

, и . Australasian Conference on Artificial Intelligence, том 11919 из Lecture Notes in Computer Science, стр. 117-129. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

An Interpolation-based Compiler and Optimizer for Relational Queries (System design Report)., и . LPAR (Short Presentations), том 1 из Kalpa Publications in Computing, стр. 1-10. EasyChair, (2017)On Limited Conjunctions in Polynomial Feature Logics, with Applications in OBDA., , , и . KR, стр. 655-656. AAAI Press, (2018)On Decidability and Complexity of Description Logics with Uniqueness Constraints., , и . Description Logics, том 33 из CEUR Workshop Proceedings, стр. 193-202. CEUR-WS.org, (2000)Pushing the CFDnc Envelope., и . Description Logics, том 1193 из CEUR Workshop Proceedings, стр. 340-351. CEUR-WS.org, (2014)Data Expiration and Aggregate Queries.. AMW, том 450 из CEUR Workshop Proceedings, CEUR-WS.org, (2009)Logical Data Expiration.. Logics for Emerging Applications of Databases, стр. 203-238. Springer, (2003)First-Order Queries over Temporal Databases Inexpressible in Temporal Logic., и . EDBT, том 1057 из Lecture Notes in Computer Science, стр. 307-324. Springer, (1996)Finding ALL Answers to OBDA Queries Using Referring Expressions., и . Australasian Conference on Artificial Intelligence, том 11919 из Lecture Notes in Computer Science, стр. 117-129. Springer, (2019)Conjunctive Query Answering in CFDnc : A PTIME Description Logic with Functional Constraints and Disjointness., и . Australasian Conference on Artificial Intelligence, том 8272 из Lecture Notes in Computer Science, стр. 350-361. Springer, (2013)Concerning Referring Expressions in Query Answers., , и . IJCAI, стр. 4791-4795. ijcai.org, (2017)