| paper | d4-conf-aaai-2002-0142 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
The numbered propositions establish a semantic property and a limit on translation expressiveness; neither gives an algorithm, a complexity result, or a solver formulation used to compute. The implementation discussion points to complexity results in a companion paper, but does not state a named computational result here to anchor a mirror.
fails bit a — no named computational result to mirror
No result in this paper anchors a continuous-population mirror; Proposition 1 is semantic, Proposition 2 concerns translation expressiveness, and the complexity results are only mentioned as appearing in a separate paper.
I can’t give an honest positive case with an eligible anchor: the paper contains no numbered Theorem, Lemma, Corollary, or Proposition asserting a complexity classification such as polynomial-time solvability or NP-hardness.
Proposition 1 says that every answer set satisfies each rule to some degree. Proposition 2 says there is no translation from LPODs to extended logic programs without ordered disjunction that preserves preferred answer sets for every program; its example yields preferred answer sets \(\{b,\neg c\}\) and \(\{a,b,\neg c\}\), which are not subset-minimal. That is a representability result, not a complexity result about an underlying problem. The paper’s only complexity pointer says that a separate implementation paper contains related results, without stating or numbering them here.
A large population of users sharing a finite set of configuration preferences might support a continuous model, but this paper studies preferred answer sets of a propositional program, not a population. Without a named computational result to anchor the mirror, specifying such a problem would be an extrapolation, not a case grounded in this paper’s results.
The proponent’s case stands on the decisive point: this paper gives no named computational result to continuize. Proposition 1 is a semantic property of answer sets. Proposition 2 is a representation impossibility: preferred answer sets need not be subset-minimal, so an extended logic program cannot preserve them in general. Neither classifies the complexity of a computational problem. The paper describes an implementation, but leaves its complexity results to a separate companion paper; importing those results would no longer be anchoring the mirror in a result stated here. [The companion paper](https://users.ics.aalto.fi/ini/papers/BNS-jelia2002.pdf)
Proposition 2 is the strongest candidate for an anchor, but a mass distribution does not make it one. Its subject is whether a translation preserves the preferred answer sets of a single LPOD. Putting mass on answer sets makes the *outcomes* continuous; putting mass on LPODs or decision makers adds a population and requires a new aggregation problem. Neither is a continuization of Proposition 2’s question.
The best application-based proposal would give many configuration users LPOD preference types and ask for a collectively preferred design. That could be a sensible new project, but this paper’s semantics rank answer sets of one program, and its decision-making section models one agent choosing among decisions and possible states. A collective version would need a new rule for reconciling agents’ preferences. The paper offers several ways to compare outcomes and explicitly treats further investigation of decision strategies as future work. The resulting question may be worthwhile; it is not a continuous mirror of a computational result in this paper.
So the negative case is strong for the paper as presented, but weaker as an absolute claim that no scenario could ever yield a useful continuous model. A population of stakeholders or repeated configuration requirements is imaginable. The point is that making either one computationally meaningful requires adding a new collective problem and result to anchor it; the paper itself does not supply them.
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.