( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases.

, , и . J. Artif. Intell. Res., (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.

Laurent Bienvenu

Bienvenu Tollo

 

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

When is Shapley Value Computation a Matter of Counting?, , и . CoRR, (2023)Nested Regular Path Queries in Description Logics (Extended Abstract)., , , и . AMW, том 1189 из CEUR Workshop Proceedings, CEUR-WS.org, (2014)Succinctness of Query Rewriting in OWL 2 QL: The Case of Tree-like Queries., , и . Description Logics, том 1193 из CEUR Workshop Proceedings, стр. 45-57. CEUR-WS.org, (2014)Inconsistency-Tolerant Conjunctive Query Answering for Simple Ontologies.. Description Logics, том 846 из CEUR Workshop Proceedings, CEUR-WS.org, (2012)Combining Global and Local Merges in Logic-based Entity Resolution., , , и . KR, стр. 742-746. (2023)Query-Based Comparison of Mappings in Ontology-Based Data Access., и . KR, стр. 197-206. AAAI Press, (2016)Querying Inconsistent Prioritized Data with ORBITS: Algorithms, Implementation, and Experiments., и . KR, (2022)Beyond Classical Planning: Procedural Control Knowledge and Preferences in State-of-the-Art Planners., , , и . AAAI, стр. 1509-1512. AAAI Press, (2008)Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases., , и . J. Artif. Intell. Res., (2019)Regular Path Queries in Lightweight Description Logics: Complexity and Algorithms., , и . J. Artif. Intell. Res., (2015)