arXiv (All)
open access
Conservative CSPs in Symmetric Linear Datalog
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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Learning Context-Free Grammars for Grammar-Constrained Decoding via Declarative Agentic Programming with Guarantees#432608
- Augmented BNF for Syntax Specifications: ABNF#136934
- Improving Constraint Models with LLM Agents#441885
- Categorical Message Passing Language (CaMPL): Syntax and Semantics#1050613
- Categorical Message Passing Language (CaMPL): Syntax and Semantics#1028654
Record · ID 1116794
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive