On the Complexity of Existential Positive Queries HUBIE CHEN, Universidad del Pa´ıs Vasco and IKERBASQUE We systematically investigate the complexity of model checking the existential positive fragment of firstorder lo - Ikerbasque - Document - PDFSEARCH.IO

First Page	Meta Content
	On the Complexity of Existential Positive Queries HUBIE CHEN, Universidad del Pa´ıs Vasco and IKERBASQUE We systematically investigate the complexity of model checking the existential positive fragment of firstorder lo Add to Reading List Document Date: 2013-09-23 12:22:15 Open Document File Size: 538,57 KB Share Result on Facebook City Bilbao / New York / / Company ACM Inc. / / Country Spain / United States / / Currency USD / / / Facility Penn Plaza / / / IndustryTerm natural bottom-up algorithm / natural bottom-up evaluation algorithm / / Organization University of the Basque Country / Basque Foundation for Science / / Person Madelaine / Martin / / / Position Author / representative / General / / ProgrammingLanguage RC / R / / ProvinceOrState New York / / Technology natural bottom-up algorithm / natural bottom-up evaluation algorithm / / URL http / SocialTag Finite model theory Model theory Parameterized complexity Analysis of algorithms Structural complexity theory FO First-order logic SO Polynomial hierarchy Theoretical computer science

On the Complexity of Existential Positive Queries HUBIE CHEN, Universidad del Pa´ıs Vasco and IKERBASQUE We systematically investigate the complexity of model checking the existential positive fragment of firstorder loAdd to Reading List