The Meta-Problem for Conservative Mal’tsev Constraints
Authors: Clement Carbonnel
AAAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We design an algorithm that decides in polynomial-time if a constraint language has a conservative Mal tsev polymorphism, and outputs one if one exists. |
| Researcher Affiliation | Academia | Clement Carbonnel LAAS-CNRS University of Toulouse, INP Toulouse, France carbonnel@laas.fr |
| Pseudocode | No | The paper describes algorithms in prose but does not provide structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any statement or link regarding the availability of source code for the described methodology. |
| Open Datasets | No | This is a theoretical paper that does not involve empirical experiments with datasets, and therefore does not mention publicly available training data. |
| Dataset Splits | No | This is a theoretical paper that does not involve empirical experiments with datasets, and therefore does not mention validation splits. |
| Hardware Specification | No | This is a theoretical paper that does not involve empirical experiments, and therefore does not specify hardware used. |
| Software Dependencies | No | This is a theoretical paper that does not detail specific software dependencies with version numbers for replication. |
| Experiment Setup | No | This is a theoretical paper that does not involve empirical experiments, and therefore does not detail an experimental setup or hyperparameters. |