Defeasible Semantics for L4
summary
An Answer Set Programming implementation provides defeasible semantics for L4 by compiling L4 rules (prescriptive, permissive, constitutive) into a meta-program that encodes defeat, superiority and provenance predicates. The kernel uses about ten core clauses plus roughly ten more for superiority and justification, and the encoding toggles ambiguity blocking versus ambiguity propagation. The system maps spreadsheet-style L4 inputs to ASP, has been integrated with a defeasible engine used on ~50,000 norms and 708 legislative modules, and the prototype evaluation shows correct expected verdicts.
AI-written summary · about