$n$-permutability and linear Datalog implies symmetric Datalog
We show that if $\mathbb A$ is a core relational structure such that CSP($\mathbb A$) can be solved by a linear Datalog program, and $\mathbb A$ is $n$-permutable for some $n$, then CSP($\mathbb A$) can be solved by a symmetric Datalog program (and thus CSP($\mathbb A$) lies in deterministic logspac...
| Hoofdauteur: | |
|---|---|
| Formaat: | Artikel |
| Taal: | English |
| Gepubliceerd in: |
Logical Methods in Computer Science e.V.
2018-04-01
|
| Reeks: | Logical Methods in Computer Science |
| Onderwerpen: | |
| Online toegang: | https://lmcs.episciences.org/2029/pdf |