Papers by Robin Young
NP-Hard Lower Bound Complexity for Semantic Self-Verification (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing work on semantic self-verification has been focused on mechanistic interpretation, but the computational complexity of semantic self verification has remained undercharacterized. |
| Approach: | They propose to formalize Semantic Self-Verification as problem of determining whether a statement accurately characterizes its own semantic properties within a given interpretive framework. |
| Outcome: | The proposed model is NP-complete and has implications for safety and fairness approaches . a 3-SAT formula is used to model an instance of SSV involving ambiguous terms . |