No article text was recorded for this version.
algebraic clone classification
Version 1 of 139 papers52 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Complexity of non-monotonic logics
- Blog: The Complexity of Reasoning for Fragments of Default Logic
- Blog: Robust Approximation of Temporal CSP
- Blog: Testing Assignments to Constraint Satisfaction Problems
- Blog: 09441 Abstracts Collection – The Constraint Satisfaction Problem: Complexity and Approximability
- Blog: An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
- Blog: On the complexity of CSP-based ideal membership problems
- Blog: 06401 Abstracts Collection - Complexity of Constraints
- Blog: Backdoors into Heterogeneous Classes of SAT and CSP
- Blog: The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
- Blog: Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs
- Blog: Propositional Abduction is Almost Always Hard
- Blog: The Complexity of Boolean Constraint Isomorphism
- Blog: On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
- Blog: Walking the Complexity Lines for Generalized Guarded Existential Rules
- Blog: Testing List H-Homomorphisms
- Blog: Minimal Distance of Propositional Models
- Blog: Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems
- Blog: The tractability of model checking for LTL: The good, the bad, and the ugly fragments
- Blog: Expansions of abelian square-free groups
- Blog: The Complexity of Closed World Reasoning and Circumscription
- Blog: Model Checking for Modal Dependence Logic: An Approach Through Post's Lattice
- Blog: Learnability of Solutions to Conjunctive Queries: The Full Dichotomy
- Blog: The Complexity of Reasoning for Fragments of Autoepistemic Logic
- Blog: Complexity of Reasoning with Cardinality Minimality Conditions
- Blog: Inverse Circumscription
- Blog: On Backdoors To Tractable Constraint Languages
- Blog: The Complexity of Reasoning for Fragments of Autoepistemic Logic
- Blog: Correlation Decay and Tractability of CSPs
- Blog: The complexity of propositional implication
- Blog: The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
- Blog: The Meta-Problem for Conservative Mal'tsev Constraints
- Blog: Query Answer Explanations under Existential Rules
- Blog: The model checking fingerprints of CTL operators
- Blog: Streamlining Input/Output Logics with Sequent Calculi (Extended Abstract)
- Blog: Complexity classifications for different equivalence and audit problems for Boolean circuits
- Blog: Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures
- Blog: The Complexity of Generalized Satisfiability for Linear Temporal Logic
- Blog: Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_algebraic_clone_classification_b6ad82bf,
title = {algebraic clone classification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/algebraic-clone-classification/rdr_b6ad82bf2fa648cca1da16c73fcce887},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_algebraic_clone_classification_b6ad82bf_v1,
title = {algebraic clone classification},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/algebraic-clone-classification/rdr_b6ad82bf2fa648cca1da16c73fcce887/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}