The Extendable-Triple Property: A New CSP Tractable Class beyond BTP

Authors: Philippe Jégou, Cyril Terrioux

AAAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Experimental We give the theoretical material about this new class and we present an experimental study which shows that from a practical viewpoint, it seems more usable in practice than BTP.
Researcher Affiliation Academia Philippe J egou and Cyril Terrioux Aix-Marseille Universit e, CNRS LSIS UMR 7296 Avenue Escadrille Normandie-Niemen 13397 Marseille Cedex 20 (France) {philippe.jegou, cyril.terrioux}@lsis.org
Pseudocode No The paper does not contain any pseudocode or algorithm blocks.
Open Source Code No The paper does not provide any concrete access to source code for the methodology described.
Open Datasets Yes Now, we wonder whether some instances usually exploited as benchmarks for solver comparisons satisfy the ETP property. With this aim in view, we consider 2,260 binary benchmarks of the CSP 2008 Competition3. ... 3See http://www.cril.univ-artois.fr/CPAI08 for more details.
Dataset Splits No The paper mentions using "2,260 binary benchmarks of the CSP 2008 Competition" but does not specify any training, validation, or test dataset splits.
Hardware Specification No The paper does not provide specific hardware details (e.g., CPU, GPU models, or memory) used for running its experiments.
Software Dependencies No The paper mentions algorithms and heuristics like MAC, RFL, dom/wdeg heuristic, AC, and SPC, but it does not provide specific version numbers for any software dependencies.
Experiment Setup Yes In practice, all the instances satisfying the ETP property (which belong or not to the class ETP-SPC) are solved in a backtrack free-manner by MAC and RFL with the dom/wdeg heuristic (Boussemart et al. 2004) or a random variable ordering. ... a natural solution consists in achieving an AC or SPC filtering as pre-processing step.