| paper | d4-conf-ijcai-1997-0003 |
| authors | — |
| venue | ? |
| filed under | unclassified |
| judged by | gpt-6-luna / xhigh (triple__luna__xhigh__c6r1) |
| judge confidence | high |
| authors would recognise it | no |
Theorem 4.1.5 and the other described theorems concern the translation and its semantics, without a named computational result to anchor. The proposed legal-case population reduces either to batch evaluation or to a new collective semantics and objective, leaving no continuous question tied to a result of this paper.
fails bit a — no named computational result to mirror
No result receives a continuous mirror; the paper's translation and extension results are left without a qualifying computational anchor.
This paper has no named computational result to anchor a continuous mirror. It names theorems about translating preference-ordered default theories into standard default logic and about the resulting theories’ extensions. For example, Theorem 4.1.5 is described as letting the translation detect when a default is blocked. Those are formal results about representation and semantics, not complexity classifications or algorithmic results for a computational problem.
The paper’s claim that existing default-logic provers can use the translation is motivation, not an analysis of running time or tractability. I can’t give a continuous problem that faithfully mirrors a named hardness or algorithm result here: aggregating a population of reasoning cases would introduce a new collective problem, rather than continuize one this paper studies.
The case submitted under “CASE FOR” does not actually identify a continuous mirror. The closest named result, Theorem 4.1.5, concerns detecting when a default is blocked inside the translation. The other described theorems establish properties of the translation and its extensions. None gives a complexity or algorithmic result to continuize; the claim that existing provers can use the translation is motivation, not an analysis of their computational performance.
The strongest alternative is a population of legal cases with different fact patterns, each evaluated under shared defaults and priorities. A distribution over case types is plausible, especially given the paper’s legal example. But if each type is evaluated separately, mass only weights a summary of the answers; the paper’s task remains solving one default theory at a time. If cases are pooled into one theory, ordinary default logic has no mass for a rule: defaults are members of a set, so duplicating one does not increase its influence, while combining facts and rules can change extensions through global conflicts. Giving defaults weights or optimizing priorities to maximize agreement across cases could create a useful new problem, but it would require a new semantics and objective that this paper neither studies nor establishes results about.
So the negative case is strongest at the level of a *mirror of this paper*: there is no computational result here to anchor one, and the best population scenario leads either to batch evaluation or to a newly defined collective reasoning problem. A continuous study inspired by the paper is conceivable; the supplied text does not make it this paper’s continuous mirror.
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.