m-chrzan.xyz
aboutsummaryrefslogtreecommitdiff
path: root/mgr.tex
diff options
context:
space:
mode:
Diffstat (limited to 'mgr.tex')
-rw-r--r--mgr.tex14
1 files changed, 7 insertions, 7 deletions
diff --git a/mgr.tex b/mgr.tex
index 8005fd9..8463780 100644
--- a/mgr.tex
+++ b/mgr.tex
@@ -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}