| paper | d4-conf-ijcai-2015-0175 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The paper contains no numbered computational result of its own to anchor a mirror. Its MDD example is illustrative, its variable-ordering and preference-extension questions are proposed future work, and the GAC complexity claim is cited from prior work.
fails bit a — no named computational result to mirror
No result is mirrored; the paper illustrates MDD representation, proposes future research questions, and cites a GAC complexity result from prior work.
I can’t make a defensible positive case from this paper. It contains no numbered Theorem, Lemma, Corollary, or Proposition asserting a computational result to anchor a mirror. Example 1 constructs an MDD for a constraint set; the variable-ordering and preference-extension items are proposed future questions, not results. The GAC complexity claim is cited to prior work by Cheng and Yap, not proved here.
The central object is the set of feasible assignments to variables, represented compactly by an MDD. There is no population of agents whose types could carry mass. Turning outcomes, preferences, or uncertainty into a distribution would change what the paper studies rather than continuize its population. So there is no honest per-anchor continuous problem to hand to a prover, and no lead mirror. The nearest computational foothold—the open question of finding a variable order that yields a compact MDD—does not supply the required named result or a population-based mirror.
The case for offers no positive anchor, so there is no surviving mirror to defeat. For this paper, the negative case is strong: it reports no computational theorem to continuize. Its variable-ordering and preference-extension questions are proposed future work; Example 1 is an illustration; and the GAC complexity result belongs to cited prior work.
The best repair would be to imagine many users with preferences represented by constraints or weighted logics, then ask for collectively optimal feasible outcomes. That could be a worthwhile continuous social-choice problem. But it adds the population, an aggregation rule, and an optimization objective. The paper studies none of those: its questions concern representing a feasible set and extending that representation with preference information.
Treating assignments or MDD variables as the population does not supply the missing bridge. Assignments are outcomes, and constraints couple their components; a distribution over them would change the object being represented. Even a carefully designed high-multiplicity model would therefore be a new problem built around MDDs, not a continuous mirror of a result in this paper.
I would not claim that no conceivable scenario could connect MDDs to continuous social choice. The honest negative claim is narrower: this paper gives ChoCo no computational result to mirror, and turning its subject into a population problem requires adding the central social-choice task rather than continuizing one already present.
The adversarial triple: the proponent anchors on up to three named results; the opponent sees that case and must defeat every anchor; the judge decides which case convinced it. These are the pipeline’s own outputs, generated by tools/triple_run.py — no human edited them. The paper’s own text is not reproduced here beyond the quoted statement above.