The parameterized space complexity of model-checking bounded variable first-order logic

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-...

Full description

Bibliographic Details

Published in:	Logical methods in computer science Vol. 15, Issue 3
Main Authors:	Chen, Yijia, Elberfeld, Michael, Müller, Moritz
Format:	Journal Article Publication
Language:	English
Published:	Logical Methods in Computer Science e.V 01.01.2019
Subjects:	Algorísmica i teoria de la complexitat Bounded variable first-order logic Complexitat computacional Computational complexity computer science - logic in computer science First-order logic Informàtica Informàtica teòrica Llenguatges d'interrogació (Informàtica) Lògica de primer ordre Model-checking Parameterized logarithmic space Query languages (Computer science) Àrees temàtiques de la UPC
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!