![Finite model theory / Model theory / Parameterized complexity / Analysis of algorithms / Structural complexity theory / FO / First-order logic / SO / Polynomial hierarchy / Theoretical computer science / Computational complexity theory / Applied mathematics Finite model theory / Model theory / Parameterized complexity / Analysis of algorithms / Structural complexity theory / FO / First-order logic / SO / Polynomial hierarchy / Theoretical computer science / Computational complexity theory / Applied mathematics](https://www.pdfsearch.io/img/4bdae96a2c9ed506b9c075c8cf9ef60e.jpg) Date: 2013-09-23 12:22:15Finite model theory Model theory Parameterized complexity Analysis of algorithms Structural complexity theory FO First-order logic SO Polynomial hierarchy Theoretical computer science Computational complexity theory Applied mathematics | | 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 ListSource URL: tocl.acm.orgDownload Document from Source Website File Size: 538,57 KBShare Document on Facebook
|