On the Modelling of Constraints with Tractable Logical Operators
Authors: Ruiwei Wang, Roland H. C. Yap
AAAI 2025 | Venue PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | We apply the logical operators of op-BCT and OMDD to model reified constraints and product configuration problems. We implement the logical operators for op-BCT and OMDD, and using them to construct BCT and MDD constraints in the models below. For the implementation of op BCT, we use rules from (Wang and Yap 2022b) to do reduction, and for OMDD, we follow (Perez and R egin 2015). The MDDc GAC propagator (Cheng and Yap 2010) and BCT AC propagator (Wang and Yap 2022b) in the Abscon solver (Merchez, Lecoutre, and Boussemart 2001) are used to handle the MDD and BCT constraints. Experiments were conducted on a 3.20GHz Intel i7-8700 machine with Ubuntu 12.3 and 16GB of RAM. Timeout is 600 seconds and instances are run once. |
| Researcher Affiliation | Academia | Ruiwei Wang and Roland H.C. Yap School of Computing, National University of Singapore EMAIL, EMAIL |
| Pseudocode | No | The paper describes theoretical concepts and then applies them in practical applications, but it does not include any explicitly labeled pseudocode or algorithm blocks with structured steps. |
| Open Source Code | No | The paper does not contain an explicit statement that the authors' code is open-sourced, nor does it provide a link to a code repository or indicate that code is included in supplementary materials for the methodology described. |
| Open Datasets | Yes | We use 7 series of instances from CSP competition 20093 to evaluate op-BCT and OMDD on modelling reified constraints: bdd Small, dag-half, lex Vg, uk Vg, words Vg, TSP20 and TSP-25. The CSP model evaluated is: (i) for each constraint ci in an instance, a refined constraint yi ci is used to combine ci with a variable yi; and (ii) a sum constraint y1 + + yn = k is used to model that there are exactly k satisfied constraints. Experiments use k = n 1. In total, there are 122 instances after removing the trivial instances can be solved by both methods in 1 second, where the search heuristic is WDeg (Boussemart et al. 2004). ... 3www.cril.univ-artois.fr/CSC09 ... We evaluate op-BCT on models from product configuration instances (Bessiere, Fargier, and Lecoutre 2016). |
| Dataset Splits | No | The paper refers to using instances from the CSP competition 2009 and product configuration instances. It mentions that 'Experiments use k = n 1' and 'The Min Fill ordering is used in the experiment' as settings, but it does not specify any training, validation, or test dataset splits (e.g., percentages or sample counts) for the data used. |
| Hardware Specification | Yes | Experiments were conducted on a 3.20GHz Intel i7-8700 machine with Ubuntu 12.3 and 16GB of RAM. Timeout is 600 seconds and instances are run once. |
| Software Dependencies | No | The paper mentions 'Ubuntu 12.3' (an operating system version) and 'Abscon solver', but it does not provide a specific version number for the Abscon solver itself. It also does not list multiple key software components with their respective versions. |
| Experiment Setup | Yes | Timeout is 600 seconds and instances are run once. ... In total, there are 122 instances after removing the trivial instances can be solved by both methods in 1 second, where the search heuristic is WDeg (Boussemart et al. 2004). ... Experiments use k = n 1. ... The Min Fill ordering is used in the experiment. |