arXiv (All)
open access
Finitely Related Clones: Action Algebras and Applications to Free Algebras
For finite-domain constraint satisfaction problems (CSPs), the polymorphism clone provides an algebraic framework for studying the associated constraint language. A central question in clone theory is whether a clone is finitely related, that is, whether it is determined by the operations preserving
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
- FIKA: Expanding Dependency Reachability with Executability Guarantees#124120
- Existence and nonexistence of commutativity gadgets for entangled CSPs#1062636
- Setiya on Consequentialism and Constraints#712550
- LLM-as-Code Agentic Programming for Agent Harness#282880
- Accumulators: New Logic Variable Abstractions for Functional Languages#493408
Record · ID 1131645
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