diff options
author | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2022-10-21 16:53:36 +0200 |
---|---|---|
committer | Marcin Chrzanowski <mc370754@students.mimuw.edu.pl> | 2022-10-21 16:53:36 +0200 |
commit | e0397c2f34a242c0533403c9469b7506eac264b8 (patch) | |
tree | b4e6851b55872a3e92286384f0469149736a43a9 | |
parent | fafe39e65241f4bc041e35e6c82624e8b5a67d65 (diff) |
Mention different name
-rw-r--r-- | mgr.tex | 14 |
1 files changed, 7 insertions, 7 deletions
@@ -180,13 +180,13 @@ free variables are all first-order is in \constantdelaylin, and factorization forests due to \textcite{colcombet} rather than Bagan's intricate indexing structure. -Most closely related, \textcite{kazanaphd} showed that MSO query answering on -structures of bounded treewidth is \constantdelaylin in his PhD thesis, however -this result was limited to MSO queries with only first-order variables. This -work generalizes to also allowing set variables in the query, and uses a -different approach. Here again Kazana relied on Colcombet's factorization, an -application of semigroup theory. Our appraoch is more algorithmic and -straigforward. +Most closely related, \textcite{kazanaphd} showed that MSO query answering +(there called \emph{query testing}) on structures of bounded treewidth is +\constantdelaylin in his PhD thesis, however this result was limited to MSO +queries with only first-order variables. This work generalizes to also allowing +set variables in the query, and uses a different approach. Here again Kazana +relied on Colcombet's factorization, an application of semigroup theory. Our +appraoch is more algorithmic and straigforward. \section{Organization} |