When is Na¨ıve Evaluation Possible? Am´elie Gheerbrant, Leonid Libkin, Cristina Sirangelo To cite this version: Am´elie Gheerbrant, Leonid Libkin, Cristina Sirangelo. When is Na¨ıve Evaluation Possible?. PODS - 32n - Rutgers School of Public Affairs and Administration - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2014-11-10 14:14:40 Model theory Database theory Conjunctive query Modal logic Null Structure Kripke semantics FO Closed world assumption Logic Mathematics Mathematical logic		When is Na¨ıve Evaluation Possible? Am´elie Gheerbrant, Leonid Libkin, Cristina Sirangelo To cite this version: Am´elie Gheerbrant, Leonid Libkin, Cristina Sirangelo. When is Na¨ıve Evaluation Possible?. PODS - 32n Add to Reading List Source URL: www.liafa.univ-paris-diderot.fr Download Document from Source Website File Size: 426,68 KB Share Document on Facebook

	Verification of Conjunctive-Query Based Semantic Artifacts? Babak Bagheri Hariri1 , Diego Calvanese1 , Giuseppe De Giacomo2 , and Riccardo De Masellis2 1 DocID: 1tpms - View Document
	Combined FO Rewritability for Conjunctive Query Answering in DL-Lite R. Kontchakov,1 C. Lutz,2 D. Toman,3 F. Wolter4 and M. Zakharyaschev1 1 School of CS and Information Systems 2 Fachbereich Mathematik und Informatik DocID: 1tbKN - View Document
	Conjunctive Query Entailment: Decidable in Spite of O, I, and Q Birte Glimm1 and Sebastian Rudolph2 2 1 DocID: 1tbFD - View Document
	Joint EDBT/ICDT 2011 Ph.D. Workshop March 25th, 2011 (http://www.ai4.uni-bayreuth.de/en/events/edbt_icdt_phd_2011/index.html) - Schedule - DocID: 1ru0F - View Document
	Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family Diego Calvanese Faculty of Computer Science Free University of Bozen-Bolzano Piazza Domenicani 3 DocID: 1r5sN - View Document