Solving Infinite-Domain CSPs Using the Patchwork Property
Authors: Konrad K Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov3715-3723
AAAI 2021 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | Our main result is an fpt algorithm for CSPs where the underlying basic relations have the patchwork property (Lutz and Miliˇci c 2007). Several important CSPs (such as Allen s algebra and RCC8) are known to have this property. The patchwork property ensures that the union of two satisfiable CSPs, whose constraints agree on their common variables, is also satisfiable. With the discussion above in mind, it is clear that our algorithm has better computational properties than the two previous ones. |
| Researcher Affiliation | Academia | Konrad K. Dabrowski,1 Peter Jonsson,2 Sebastian Ordyniak,3 George Osipov2 1Durham University 2Link oping University 3University of Leeds |
| Pseudocode | No | The paper describes the algorithm's steps in text but does not provide structured pseudocode or an algorithm block. |
| Open Source Code | No | The paper does not contain any statement or link indicating that source code for the described methodology is publicly available. |
| Open Datasets | No | The paper is theoretical and does not describe experiments involving datasets for training, validation, or testing. |
| Dataset Splits | No | The paper is theoretical and does not describe experiments involving dataset splits. |
| Hardware Specification | No | The paper is theoretical and does not describe any experimental setup or hardware specifications. |
| Software Dependencies | No | The paper is theoretical and does not describe any experimental setup or specific software dependencies with version numbers. |
| Experiment Setup | No | The paper is theoretical and does not describe any experimental setup details such as hyperparameters or training configurations. |