Just-in-Time Hierarchical Constraint Decomposition

Authors: Valentin Mayer-Eichberger

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

Reproducibility Variable Result LLM Response
Research Type Experimental Preliminary work for this Ph D has been in eager SAT encodings for Pseudo Boolean and SEQUENCE constraint (Ab ıo et al. 2012; Artigues et al. 2014). Currently, the focus is on decompositions of ALL-DIFFERENT to extend the LCG solver CHUFFED to take advantage of the JIT-HCD approach.
Researcher Affiliation Academia Valentin Mayer-Eichberger NICTA and University of New South Wales Valentin.Mayer-Eichberger@nicta.com.au. Supervisors: Toby Walsh with co-supervisors Michael Thielscher and Serge Gaspers (University of New South Wales and NICTA). Collaborators: Peter Stuckey and Ignasi Ab ıo (University of Melbourne and NICTA).
Pseudocode No The paper does not contain any pseudocode or clearly labeled algorithm blocks.
Open Source Code No The paper mentions extending an existing solver (CHUFFED) but does not provide a link or explicit statement about releasing the source code for the described methodology (JIT-HCD).
Open Datasets No The paper is a conceptual extended abstract outlining a research project. It does not describe experiments performed on a specific dataset and therefore provides no information about public dataset access.
Dataset Splits No The paper is a conceptual extended abstract and does not report on experiments with dataset splits for training, validation, or testing.
Hardware Specification No The paper does not specify any hardware details (e.g., GPU/CPU models, memory) used for experiments.
Software Dependencies No The paper mentions 'LCG solver CHUFFED' but does not specify a version number. No other specific software dependencies with version numbers are provided.
Experiment Setup No The paper does not provide specific experimental setup details such as hyperparameters or training configurations.