@article{journals/sigact/Lenzerini08,
	title = {Database theory column: report on PODS 2008.},
	author = {Maurizio Lenzerini},
	journal = {SIGACT News},
	number = {3},
	pages = {63-65},
	url = {http://dblp.uni-trier.de/db/journals/sigact/sigact39.html#Lenzerini08},
	volume = {39},
	year = {2008},
	biburl = {http://www.bibsonomy.org/bibtex/2bd247ad2f2c4d1f2fc7aa085d9010a79/dblp},
	description = {dblp},
	ee = {http://doi.acm.org/10.1145/1412700.1412715}, date = {2008-11-25},
	keywords = {dblp }
}

@inproceedings{conf/sdb/CalvaneseGLLPRR08,
	title = {Data Integration throughDL-LiteA Ontologies.},
	author = {Diego Calvanese and Giuseppe De Giacomo and Domenico Lembo and Maurizio Lenzerini and Antonella Poggi and Riccardo Rosati and Marco Ruzzi},
	booktitle = {SDKB},
	crossref = {conf/sdb/2008},
	editor = {Klaus-Dieter Schewe and Bernhard Thalheim},
	pages = {26-47},
	publisher = {Springer},
	series = {Lecture Notes in Computer Science},
	url = {http://dblp.uni-trier.de/db/conf/sdb/sdkb2008.html#CalvaneseGLLPRR08},
	volume = {4925},
	year = {2008},
	biburl = {http://www.bibsonomy.org/bibtex/27229c1e9c45080a3f589a8e899ac212d/dblp},
	description = {dblp},
	date = {2008-11-23}, ee = {http://dx.doi.org/10.1007/978-3-540-88594-8_2}, isbn = {978-3-540-88593-1},
	keywords = {dblp }
}

@article{Donini97,
	title = {The Complexity of Concept Languages},
	author = {Francesco M. Donini and Maurizio Lenzerini and Daniele Nardi and Werner Nutt},
	journal = {Information and Computation},
	pages = {1--58},
	volume = {134},
	year = {1997},
	biburl = {http://www.bibsonomy.org/bibtex/2acb541f064aea7a1f3ed34605c51bbb3/marciomr},
	timestamp = {2007.08.27}, owner = {mauro},
	keywords = {DLs complexity }
}

@inproceedings{Calvanese05,
	title = {DL-Lite: Tractable Description Logics for Ontologies.},
	author = {Diego Calvanese and Giuseppe De Giacomo and Domenico Lembo and Maurizio Lenzerini and Riccardo Rosati},
	booktitle = {AAAI},
	crossref = {aaai2005},
	editor = {Manuela M. Veloso and Subbarao Kambhampati},
	pages = {602-607},
	publisher = {AAAI Press / The MIT Press},
	url = {http://dblp.uni-trier.de/db/conf/aaai/aaai2005.html#CalvaneseGLLR05},
	year = {2005},
	biburl = {http://www.bibsonomy.org/bibtex/22ff6fda7b6fb0ae468b6f4a2ea60aaae/marciomr},
	description = {dblp},
	isbn = {1-57735-236-X}, date = {2005-09-01},
	keywords = {DLs }
}

@article{Giacomo2007,
	title = {On the Approximation of Instance Level Update and Erasure in Description Logics},
	author = {Giuseppe De Giacomo and Maurizio Lenzerini and Antonella Poggi and Riccardo Rosati},
	booktitle = {AAAI 2007},
	journal = {Proc. of the National Conference on Artificial Intelligence},
	number = {1},
	pages = {403},
	volume = {22},
	year = {2007},
	biburl = {http://www.bibsonomy.org/bibtex/2a7d826e84084372facc35b3ca0400dd5/fraktalek},
	abstract = {A Description Logics knowledge base is constituted by two components, called TBox and ABox, where the former expresses general knowledge about the concepts and their relationships, and the latter describes the properties of instances of concepts. We address the problem of how to deal with changes to a Description Logic knowledge base, when these changes affect only its ABox. We consider two types of changes, namely update and erasure, and we characterize the semantics of these operations on the basis of the approaches proposed by Winslett and by Katsuno and Mendelzon. It is well known that, in general, Description Logics are not closed with respect to updates, in the sense that the set of models corresponding to an update applied to a knowledge base in a Description Logic L may not be expressible by ABoxes in L. We show that this is true also for erasure. To deal with this problem, we introduce the notion of best approximation of an update (erasure) in a DL L, with the goal of characterizing the L ABoxes that capture the update (erasure) at best. We then focus on DL-LiteF, a tractable Description Logic, and present polynomial algorithms for computing the best approximation of updates and erasures in this logic, which shows that the nice computational properties of DL-LiteF are retained in dealing with the evolution of the ABox.},
	posted-at = {2008-11-13 14:13:56}, citeulike-article-id = {3508808}, priority = {2},
	keywords = {kiwi }
}

@article{Giacomo2007a,
	title = {On the Approximation of Instance Level Update and Erasure in Description Logics},
	author = {Giuseppe De Giacomo and Maurizio Lenzerini and Antonella Poggi and Riccardo Rosati},
	journal = {Proc. of the national conference on artificial intelligence},
	volume = {22},
	year = {2007},
	biburl = {http://www.bibsonomy.org/bibtex/2a227903563c09c4bcb124bdad36dcfa6/fraktalek},
	abstract = {A Description Logics knowledge base is constituted by two components, called TBox and ABox, where the former expresses general knowledge about the concepts and their relationships, and the latter describes the properties of instances of concepts. We address the problem of how to deal with changes to a Description Logic knowledge base, when these changes affect only its ABox. We consider two types of changes, namely update and erasure, and we characterize the semantics of these operations on the basis of the approaches proposed by Winslett and by Katsuno and Mendelzon. It is well known that, in general, Description Logics are not closed with respect to updates, in the sense that the set of models corresponding to an update applied to a knowledge base in a Description Logic L may not be expressible by ABoxes in L. We show that this is true also for erasure. To deal with this problem, we introduce the notion of best approximation of an update (erasure) in a DL L, with the goal of characterizing the L ABoxes that capture the update (erasure) at best. We then focus on DL-LiteF, a tractable Description Logic, and present polynomial algorithms for computing the best approximation of updates and erasures in this logic, which shows that the nice computational properties of DL-LiteF are retained in dealing with the evolution of the ABox.},
	posted-at = {2008-11-13 14:13:57}, priority = {2}, citeulike-article-id = {3508809},
	keywords = {kiwi }
}

@article{keyhere,
	title = {Tractable Reasoning and Efficient Query Answering in Description Logics: The 
DL-LiteFamily},
	author = {Diego Calvanese and Giuseppe De Giacomo and Domenico Lembo and Maurizio Lenzerini and Riccardo Rosati},
	journal = {Journal of Automated Reasoning},
	month = {#oct#},
	number = {3},
	pages = {385--429},
	url = {http://dx.doi.org/10.1007/s10817-007-9078-x},
	volume = {39},
	year = {2007},
	biburl = {http://www.bibsonomy.org/bibtex/22eae8c30741753abe6b8063082035d17/joergh},
	description = {SpringerLink - Zeitschriftenbeitrag},
	abstract = {Abstract  We propose a new family of description logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages, while keeping low complexity of reasoning. Reasoning here means
not only computing subsumption between concepts and checking satisfiability of the whole knowledge base, but also answeringcomplex queries (in particular, unions of conjunctive queries) over the instance level (ABox) of the DL knowledge base. Weshow that, for the DLs of the DL-Lite family, the usual DL reasoning tasks are polynomial in the size of the TBox, and query answering is LogSpace in the size of the ABox (i.e., in data complexity). To the best of our knowledge, this is the first result of polynomial-timedata complexity for query answering over DL knowledge bases. Notably our logics allow for a separation between TBox and ABoxreasoning during query evaluation: the part of the process requiring TBox reasoning is independent of the ABox, and the partof the process requiring access to the ABox can be carried out by an SQL engine, thus taking advantage of the query optimizationstrategies provided by current database management systems. Since even slight extensions to the logics of the DL-Lite family make query answering at least NLogSpace in data complexity, thus ruling out the possibility of using on-the-shelf relational technology for query processing, wecan conclude that the logics of the DL-Lite family are the maximal DLs supporting efficient query answering over large amounts of instances.},
	keywords = {imported }
}

@incollection{handbook-AR-2001,
	title = {Reasoning in Expressive Description Logics},
	author = {Diego Calvanese and Giuseppe De Giacomo and Maurizio Lenzerini and Daniele Nardi},
	booktitle = {Handbook of Automated Reasoning},
	editor = {Alan Robinson and Andrei Voronkov},
	pages = {1581-1634},
	publisher = {Elsevier Science Publishers},
	year = {2001},
	biburl = {http://www.bibsonomy.org/bibtex/26505d16c259de7a5c4614d2e72ef73ca/deynard},
	keywords = {DL }
}

@article{journals/debu/CalvaneseGLMP08,
	title = {Automatic Service Composition and Synthesis: the Roman Model.},
	author = {Diego Calvanese and Giuseppe De Giacomo and Maurizio Lenzerini and Massimo Mecella and Fabio Patrizi},
	journal = {IEEE Data Eng. Bull.},
	number = {3},
	pages = {18-22},
	url = {http://dblp.uni-trier.de/db/journals/debu/debu31.html#CalvaneseGLMP08},
	volume = {31},
	year = {2008},
	biburl = {http://www.bibsonomy.org/bibtex/20b0b5ffc0bb2ca473d12105b52fefb9a/dblp},
	description = {dblp},
	ee = {http://sites.computer.org/debull/A08Sept/roman.pdf}, date = {2008-09-26},
	keywords = {dblp }
}

@article{Calv+DWQ,
	title = {Data Integration in Data Warehousing},
	author = {Diego Calvanese and Giuseppe De Giacomo and Maurizio Lenzerini and Daniele Nardi and Riccardo Rosati},
	journal = {Int. J. Cooperative Inf. Syst.},
	number = {3},
	pages = {237-271},
	volume = {10},
	year = {2001},
	biburl = {http://www.bibsonomy.org/bibtex/2cf3788ef9398aa87d925cf17a9baf8f1/cabird},
	description = {my huge bibtex},
	date-added = {2008-01-20 20:38:27 -0800}, date-modified = {2008-01-20 20:38:28 -0800}, ee = {http://www.worldscinet.com/journals/ijcis/10/1003/S0218843001000345.html}, bibsource = {DBLP, http://dblp.uni-trier.de},
	keywords = {imported }
}