| paper | d4-conf-ecai-2010-0204 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | unclear |
The numbered results establish completeness, validity behavior, and translations between logics; none states an algorithm, complexity bound, hardness result, or solver formulation used to compute. A role-based mass question could be a follow-up, but it is not a continuous analogue of a computational result in this paper.
fails bit a — no named computational result to mirror
No result is mirrored; Theorems 1–4 and Corollary 1 concern validity, completeness, and inter-logic translations, while the undecidability remark is unnumbered.
The best positive angle is only a possible follow-up, not a mirror anchored in a computational result of this paper. A plausible regime would be a very large organization or platform with many agents but few recurring profiles: role, skills, preferences, costs, and other features relevant to coalition power. For type \(t\), let \(\mu_t\) be its population share. One could ask whether a coalition containing mass \(x_t\in[0,\mu_t]\) of each type can enforce a specified set of outcomes. But the paper gives no computational result for that question, and its effectivity relation has no finite input representation here. The authors’ relational examples also make type compression difficult: if collaboration links matter, types may need to encode enough of the network that their number is no longer small.
There are no named computational anchors in the paper of the kind this task requires. The nearest results do not qualify:
The paper says that HCL is generally undecidable and leaves computational properties and decidable fragments for future work, but it does not state that as a numbered computational theorem. Its central contributions are semantics, expressivity, axiomatization, and completeness.
So I would not give a prover a claimed continuous version of any named result in this paper. A mass-based coalition-ability problem could be a sensible new research question, but the continuous population, the representation of coalition power, and the computational task would all need to be introduced. The paper’s arbitrary agent domain may include infinite domains, but an infinite domain is not by itself a population distribution with meaningful type masses. That distinction is the weakest point of any positive case here—and it prevents the case from meeting the requested anchor standard.
The strongest case against a mirror starts with the paper’s actual contributions: it has no named computational result to continuize. Theorems 2–4 establish completeness and truth-preserving translations; Theorem 1 concerns the validity of two axiom schemas. These are logical results, not complexity classifications or algorithms. The paper’s remark that HCL is generally undecidable and its call for decidable fragments do not supply a computational result about a population distribution.
Theorem 2 does not become a computational mirror merely by replacing its agent domain with a nonatomic one. Completeness relates a proof system to a class of frames. To ask a computational question, one would first need to choose a decision task and give finite representations of the formulas, models, and effectivity relation. The theorem provides none of those inputs. Theorem 1 is still further from a population question: its Barcan-formula distinction is about how modal and individual quantifiers interact, not how coalition power changes with population mass.
Theorem 3 and Theorem 4 offer the closest opening, since they translate logics whose modalities are indexed by coalitions. But their constructions preserve the given effectivity relation \(N\); they do not compute or characterize it. In HCL, \(N(w,U)\) may depend on the particular set of agents \(U\), and weak playability does not make it depend only on how much of each type \(U\) contains. A type-mass version would therefore need an additional anonymity condition. Keep arbitrary \(N\), and type masses may lose information needed to determine what a coalition can enforce. Replace \(N\) with a function of type-mass vectors, and the central semantic object has changed.
The proponent’s best suggested scenario—a large organization or platform with many agents in recurring roles—could make that change sensible. One could study whether a coalition with a given mass of each role can enforce an outcome. But to make this a computational problem, one must also specify a compact representation of the game’s effectivity, especially when the logic allows relational facts such as collaboration. The paper supplies no such representation or associated algorithmic task. Those choices would define a new computational framework; they would not continuize one of its results.
So the negative case is strong for the narrow claim that this paper has a computational result worth mirroring: it does not. It is weaker as a universal claim that no worthwhile continuous computational project could grow from the paper. The anonymous, type-based coalition-power question is coherent, and the paper itself does not rule it out. I would reject it as a mirror of the paper’s theorems, but I cannot honestly establish that it is not worth asking as a new problem.
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.