← Latest papers
🤖 AI

Modeling the Diachronic Evolution of Legal Norms: An LRMoo-Based, Component-Level, Event-Centric Approach to Legal Knowledge Graphs

This paper proposes a structured, event-centric modeling pattern based on the LRMoo ontology that enables the precise, deterministic reconstruction of legal norms at any point in time by distinguishing between language-agnostic temporal versions and monolingual expressions, thereby providing a verifiable semantic foundation for trustworthy legal AI.

Original authors: Hudson de Martim

Published 2026-06-09
📖 5 min read🧠 Deep dive

Original authors: Hudson de Martim

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to read a history book, but every time a new chapter is written, the publisher doesn't just add a new page; they secretly erase the old one, rewrite the previous pages, and glue the new text over the old ink. If you wanted to know exactly what a specific sentence said in the year 1995, you'd have to guess, because the book in your hand only shows the 2024 version.

This is the problem with current legal systems and the Artificial Intelligence (AI) trying to understand them. Laws change constantly. A sentence in a constitution might be added, removed, or tweaked hundreds of times. Standard AI models are like "guessing machines"—they are great at predicting the next word in a sentence based on probability, but they are terrible at remembering the exact text of a law as it existed on a specific date in the past. They can't be trusted for high-stakes legal decisions because they don't have a perfect memory.

This paper proposes a new way to build a "Legal Time Machine" using a very strict, organized system. Here is how it works, broken down into simple concepts:

1. The "Recipe" vs. The "Translation" (The Two-Tier System)

Think of a law like a recipe.

  • The Concept (The Recipe Idea): This is the abstract idea of the dish (e.g., "Chocolate Cake"). It stays the same even if you change the ingredients.
  • The Temporal Version (The Specific Recipe Card): This is the exact list of ingredients and steps for the cake on a specific date. If you change the sugar to honey, you don't just edit the old card; you create a brand new card labeled "1992 Version." The old card is archived, and a new one is born.
  • The Language Version (The Translation): If you have the 1992 recipe card, you might have it written in English, Portuguese, or French. These are just different ways of writing down the same 1992 recipe card.

The authors' system separates the idea of the law at a specific time (the recipe card) from the words used to write it (the translation). This ensures that if the law changes, we know exactly which "card" was valid on which day.

2. The "Event" as the Hero

In most computer systems, a change is just a note saying "This was changed." In this new system, the change itself is a character in the story.

Imagine a legislative amendment (a new law changing an old one) not as a simple edit, but as a dramatic event with a script:

  • The Actor: The new law that is being passed.
  • The Action: It points to a specific part of the old law and says, "You are now retired (End of Existence)."
  • The Result: It immediately creates a brand new version of that law (Work Creation).

By treating the act of changing as a distinct event, the system creates a perfect, unbreakable chain. You can trace exactly which new law killed the old version and which new version it birthed. It's like a family tree where every birth and death is recorded with a timestamp and a cause.

3. The "Lego Brick" Approach (Component-Level)

Laws aren't just one big block of text; they are made of articles, paragraphs, and sentences.

  • Old Way: If you change one sentence in a 100-page law, the whole 100-page document is treated as "new."
  • This Paper's Way: They treat every sentence like a Lego brick. If you swap one brick (a specific paragraph), only that brick gets a new version number. The rest of the wall stays exactly the same.

This allows the system to reconstruct the law with surgical precision. You can ask, "What did Article 5, Paragraph 2 say on January 1st, 2000?" and the system can assemble the answer by grabbing the correct "bricks" that were valid on that day, ignoring the bricks that were added or removed later.

4. Why This Matters for AI

Current AI (like the chatbots we use today) is probabilistic. It says, "Based on what I've read, the law probably said X."
This new system is deterministic. It says, "Here is the exact, verified text that existed on that date."

By building a "Knowledge Graph" (a giant, interconnected map of these laws) using this strict "Event-Centric" method, the authors create a foundation where AI can be trusted to give the truth rather than a guess. It turns the chaotic history of laws into a clean, auditable timeline where every change is accounted for, every version is distinct, and the exact text of the past can be recovered with 100% certainty.

In short: The paper proposes a blueprint for a legal database that doesn't just store laws, but stores the history of every single change to every single sentence, allowing us to travel back in time and read the law exactly as it was written on any specific day.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →