{
  "abstract": "We show that the constraint satisfaction problem of any finite conservative structure that can not pp-construct st-Con (whose CSP is NL-complete) or 3Lin2 (whose CSP is Mod2L-complete) is solved by a symmetric linear Datalog program and therefore in L.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.32463",
  "author_total": 1,
  "authors": [
    {
      "name": "Florian Starke"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/fm2mb3r57wzqk.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.32463",
  "fulltext_url": null,
  "id": "fm2mb3r57wzqk",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.32463",
  "language": null,
  "licence": "CC-BY-NC-SA-4.0",
  "licence_label": "CC BY-NC-SA 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by-nc-sa/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.RA"
    ],
    [
      "openalex",
      "1703|Advanced Graph Theory Research"
    ]
  ],
  "openalex": "W7214756571",
  "pdf_url": "https://arxiv.org/pdf/2609.32463",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-29",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/fm2mb3r57wzqk.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:35Z",
      "native_id": "2609.32463",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.32463"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.RA",
      "subfield": "algebra-number-theory"
    }
  ],
  "title": "Conservative CSPs in Logspace are in Symmetric Linear Datalog (under complexity theoretic assumptions)",
  "title_text": "Conservative CSPs in Logspace are in Symmetric Linear Datalog (under complexity theoretic assumptions)",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:35Z",
  "url": "https://research.draconitic.com/paper/fm2mb3r57wzqk",
  "venue": "arXiv",
  "versions": []
}