Mostra el registre d'ítem simple
The parameterized space complexity of model-checking bounded variable first-order logic
dc.contributor.author | Chen, Yijia |
dc.contributor.author | Elberfeld, Michael |
dc.contributor.author | Muller, Moritz Martin |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2020-02-06T13:04:32Z |
dc.date.available | 2020-02-06T13:04:32Z |
dc.date.issued | 2019 |
dc.identifier.citation | Chen, Y.; Elberfeld, M.; Muller, M. The parameterized space complexity of model-checking bounded variable first-order logic. "Logical methods in computer science", 2019, vol. 15, núm. 3, p. 31:1-31:29. |
dc.identifier.issn | 1860-5974 |
dc.identifier.uri | http://hdl.handle.net/2117/176983 |
dc.description.abstract | The parameterized model-checking problem for a class of first-order sentences (queries) asks to decide whether a given sentence from the class holds true in a given relational structure (database); the parameter is the length of the sentence. We study the parameterized space complexity of the model-checking problem for queries with a bounded number of variables. For each bound on the quantifier alternation rank the problem becomes complete for the corresponding level of what we call the tree hierarchy, a hierarchy of parameterized complexity classes defined via space bounded alternating machines between parameterized logarithmic space and fixed-parameter tractable time. We observe that a parameterized logarithmic space model-checker for existential bounded variable queries would allow to improve Savitch's classical simulation of nondeterministic logarithmic space in deterministic space O(log2n). Further, we define a highly space efficient model-checker for queries with a bounded number of variables and bounded quantifier alternation rank. We study its optimality under the assumption that Savitch's Theorem is optimal. |
dc.language.iso | eng |
dc.rights | Attribution 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica::Algorísmica i teoria de la complexitat |
dc.subject.lcsh | Computational complexity |
dc.subject.lcsh | First-order logic |
dc.subject.lcsh | Query languages (Computer science) |
dc.subject.other | Model-checking |
dc.subject.other | Bounded variable first-order logic |
dc.subject.other | Parameterized logarithmic space |
dc.title | The parameterized space complexity of model-checking bounded variable first-order logic |
dc.type | Article |
dc.subject.lemac | Complexitat computacional |
dc.subject.lemac | Lògica de primer ordre |
dc.subject.lemac | Llenguatges d'interrogació (Informàtica) |
dc.identifier.doi | 10.23638/LMCS-15(3:31)2019 |
dc.description.peerreviewed | Peer Reviewed |
dc.relation.publisherversion | https://lmcs.episciences.org/5777/ |
dc.rights.access | Open Access |
local.identifier.drac | 26838336 |
dc.description.version | Postprint (published version) |
dc.relation.projectid | info:eu-repo/grantAgreement/EC/H2020/648276/EU/A Unified Theory of Algorithmic Relaxations/AUTAR |
local.citation.author | Chen, Y.; Elberfeld, M.; Muller, M. |
local.citation.publicationName | Logical methods in computer science |
local.citation.volume | 15 |
local.citation.number | 3 |
local.citation.startingPage | 31:1 |
local.citation.endingPage | 31:29 |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Articles de revista [1.049]