Mother Tree Optimization for Conditional Constraints and Qualitative Preferences
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The Constraint Satisfaction Problem (CSP) is a robust framework for representing and solving many challenging and complex problems under constraints. More specifically, a CSP includes a set of variables defined over discrete domains of values, and a set of constraints restricting the values that the variables can simultaneously take. Solving a CSP consists of finding a complete assignment of values to variables such that all the constraints are satisfied. Given that the CSP is an NP-complete problem, finding a feasible solution requires an exponential time cost in practice. To overcome this difficulty in practice, we have proposed a discrete version of our bio-inspired Mother Tree Optimization (MTO) method that we called Discrete MTO-CSP (DMTO-CSP). The Conditional CSP (CCSP) extends the CSP with variables added or removed, dynamically, following some activity constraints. CCSPs can be very relevant in many dynamic applications, such as configuration and planning, where the possible changes are known a priori and can be enumerated. In these applications, we often have to manage a set of constraints together with some users' preferences. This has motivated us to extend the CCSP model to qualitative preferences represented with the CP-net graphical model. We then propose an adapted variant of DMTO-CSP, that we call DMTO-CCSP, to solve CCSPs and CCSPs with preferences. In order to assess the performance of DMTO-CCSP, we conducted several comparative experiments on random CCSP instances generated using a variant of the known RB model. The results demonstrate the efficiency of DMTO-CSP compared to the known backtrack search technique.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it