Analysis of a clonal repertoire containing insertions and deletions

2021 ◽  
Author(s):  
Adam Still
2009 ◽  
Vol 19 (7) ◽  
pp. 1153-1164 ◽  
Author(s):  
E. M. Kvikstad ◽  
F. Chiaromonte ◽  
K. D. Makova

2004 ◽  
Vol 4 (4) ◽  
pp. 309-319 ◽  
Author(s):  
Julian C. Rayner ◽  
Curtis S. Huber ◽  
Dmitry Feldman ◽  
Paul Ingravallo ◽  
Mary R. Galinski ◽  
...  

2005 ◽  
Vol 18 (5-6) ◽  
pp. 835-842 ◽  
Author(s):  
Derong Liu ◽  
Xiaoxu Xiong ◽  
Zeng-Guang Hou ◽  
Bhaskar DasGupta

2021 ◽  
Vol 70 ◽  
pp. 1335-1371
Author(s):  
Giuseppe De Giacomo ◽  
Xavier Oriol ◽  
Riccardo Rosati ◽  
Domenico Fabio Savo

In this paper we study instance-level update in DL-LiteA , a well-known description logic that influenced the OWL 2 QL standard. Instance-level update regards insertions and deletions in the ABox of an ontology. In particular we focus on formula-based approaches to instance-level update. We show that DL-LiteA , which is well-known for enjoying first-order rewritability of query answering, enjoys a first-order rewritability property also for instance-level update. That is, every update can be reformulated into a set of insertion and deletion instructions computable through a non-recursive Datalog program with negation. Such a program is readily translatable into a first-order query over the ABox considered as a database, and hence into SQL. By exploiting this result, we implement an update component for DL-LiteA-based systems and perform some experiments showing that the approach works in practice.


Sign in / Sign up

Export Citation Format

Share Document