On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems Carsten Lutz1 and Frank Wolter2 1 2

First Page		Document Content
Date: 2015-06-14 08:17:32 Finite model theory Descriptive complexity Computational complexity theory FO Constraint programming Constraint satisfaction problem Conjunctive query SO HO Theoretical computer science Applied mathematics Complexity classes		On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems Carsten Lutz1 and Frank Wolter2 1 2 Add to Reading List Source URL: www.informatik.uni-bremen.de Download Document from Source Website File Size: 782,69 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