| paper | d4-conf-ecai-2016-0100 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Proposition 1 and the paper’s other numbered results compare preference orderings; none asserts a computational guarantee or hardness result. The proposed population-majority question adds an aggregation rule and a winner to compute, so it is an adjacent problem rather than a computational mirror anchored in this paper.
fails bit a — no named computational result to mirror
The paper studies relations among symbolic preference orderings and compares π-Pref nets with CP-nets and OCF-nets; it establishes no named computational result to mirror.
I can’t make a qualifying anchor-based case for a continuous mirror. The paper has numbered propositions, but none asserts that a computational problem is in P, NP-hard, FPT, or another complexity class. The closest result is Proposition 1, proved in this paper: for constraints comparing pairs of symbolic weights, the product ordering and symmetric Pareto ordering coincide, both for strict and weak comparisons. That is an order-theoretic equivalence, not a complexity result.
A plausible population setting would be a large user base choosing among product configurations, with many users sharing one of a modest number of complete π-Pref net types. A type would include its variables, network, preference tables, symbolic-weight constraints, and comparison rule; mass would be the fraction of users with that type. One could ask whether more mass strictly prefers configuration \(\omega\) to \(\omega'\) than prefers \(\omega'\) to \(\omega\).
That is a concrete continuous-population question, but it adds a majority aggregation rule the paper does not study. The paper gives no named computational result to anchor it, and it does not determine whether the resulting problem is tractable or hard. Calling it a mirror of Proposition 1 would overstate the case; assigning it a complexity class would be speculation.
Proposition 1 is the strongest possible anchor, but it is an equivalence between two ways of comparing symbolic vectors. It specifies no computational problem: there is no algorithmic task whose complexity the paper establishes. The other propositions likewise compare orderings; numbering them does not turn them into computational results.
The strongest rescue would be a large population of users, represented by a distribution over complete π-Pref network types, with a question such as which configuration wins under pairwise majority. That is a coherent population model, and it treats mass as a share of users rather than as a possibility weight. But it adds the collective-choice rule that the paper lacks. Its variables describe parts of one configuration, and its symbolic weights describe that configuration’s satisfaction—not voters or population shares. To make a computational task, one must introduce an aggregation rule and an outcome to compute. Those choices may support a worthwhile project, but they are not continuizations of Proposition 1 or of another result in the paper.
The universal negative is harder to establish. A continuous preference-aggregation problem built from π-Pref types could be interesting in its own right, and I cannot rule out that the authors would recognize one such extension as their problem. The case against is narrower: this paper provides no computational result for a continuous mirror to preserve, and the best population scenario requires adding a new social-choice problem. I would argue against treating it as a mirror candidate on this paper’s evidence, while conceding that a promising adjacent project could be built from its preference model.
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.