Inferensys

Glossary

Obligation Graph Diff

A comparison of the structured network of duties, rights, and conditions extracted from two contract versions to identify new, removed, or altered normative relationships between parties.
ML engineer managing model versions on laptop, version history visible, technical Git-like workflow.
Normative Relationship Comparison

What is Obligation Graph Diff?

A comparison of the structured network of duties, rights, and conditions extracted from two contract versions to identify new, removed, or altered normative relationships between parties.

An Obligation Graph Diff is a computational comparison of two structured semantic networks—known as obligation graphs—that represent the duties, rights, and conditional logic extracted from different versions of a legal agreement. Unlike a textual redline, this process operates on a formal deontic logic model, comparing the nodes (parties, actions, deadlines) and edges (obligations, permissions, prohibitions) to identify where the normative relationship between contracting parties has been fundamentally added, deleted, or modified.

This technique relies on a clause-level extraction pipeline that first parses unstructured contract language into a machine-readable graph, where a node might represent a 'Buyer' entity and a directed edge represents a 'shall deliver' duty with a temporal constraint. The diff algorithm then performs graph isomorphism and edit-distance calculations on this structured representation, flagging a semantic change—such as a payment term shifting from 'net-30' to 'net-60'—even if the surrounding textual wording has been completely rephrased, ensuring no material alteration to a party's risk profile is missed.

OBLIGATION GRAPH DIFF

Key Features

Core capabilities of an obligation graph diff engine that transforms unstructured contract text into a structured network of duties, rights, and conditions, then compares versions to surface normative changes.

01

Deontic Node Extraction

Parses contract text to identify and classify deontic modalities—obligations (shall), permissions (may), and prohibitions (shall not)—as discrete nodes in a graph. Each node captures the actor, action, and modality type, forming the atomic unit of comparison. This transforms unstructured prose into a machine-readable normative structure.

02

Relational Edge Mapping

Constructs directed edges between deontic nodes to represent normative relationships:

  • Conditional edges: Obligation X triggers only if condition Y is met
  • Reciprocal edges: Party A's duty corresponds to Party B's right
  • Hierarchical edges: A clause's sub-obligations inherit from a parent duty This graph topology enables comparison of structural changes, not just textual edits.
03

Semantic Node Alignment

Uses vector embedding similarity and cross-document coreference to match corresponding obligations across versions, even when reworded, renumbered, or relocated. A payment obligation in Section 3.2 of Version A is correctly aligned with its counterpart in Section 4.1 of Version B, preventing false-positive insertions and deletions.

04

Normative Change Classification

Classifies each detected graph delta into operation types:

  • Obligation Added: A new duty imposed on a party
  • Obligation Removed: A duty eliminated entirely
  • Modality Shifted: A 'may' becomes a 'shall' (permission to obligation)
  • Condition Narrowed: A condition precedent becomes stricter
  • Party Reassigned: A duty moves from Party A to Party B
05

Risk Impact Scoring

Assigns a materiality score to each graph change based on configurable risk policies. A modality shift from 'may' to 'shall' in an indemnification clause receives a higher severity flag than a formatting change. Integrates with playbook comparison to surface deviations from organizational standards automatically.

06

Temporal Obligation Tracking

Models time-bound normative states by attaching temporal constraints to obligation nodes. Detects when a deadline is shortened, a renewal window is narrowed, or an effective date is altered. This temporal reasoning layer ensures that changes to when a duty applies are surfaced alongside changes to what the duty is.

OBLIGATION GRAPH DIFF EXPLAINED

Frequently Asked Questions

Explore the mechanics of comparing structured networks of duties, rights, and conditions across contract versions to identify normative changes that textual redlines miss.

An Obligation Graph Diff is a computational comparison of the structured, machine-readable networks of duties, rights, and conditions extracted from two versions of a contract. Unlike a textual redline that highlights word changes, an obligation graph diff operates on a semantic graph where nodes represent parties, clauses, or defined terms, and directed edges represent deontic relationships such as 'Party A shall deliver X to Party B' or 'Party B is permitted to audit Y.' The diff algorithm first parses each contract version into its corresponding deontic logic graph, then applies graph isomorphism and edit distance algorithms to identify three critical change types: new obligations (novel edges), removed rights (deleted edges), and altered conditions (modified edge properties or threshold values). This process reveals that a seemingly minor textual change—like moving a deadline from '30 days' to '15 days'—is actually a material alteration of a performance duty, automatically flagged for legal review.

Prasad Kumkar

About the author

Prasad Kumkar

CEO & MD, Inference Systems

Prasad Kumkar is the CEO & MD of Inference Systems and writes about AI systems architecture, LLM infrastructure, model serving, evaluation, and production deployment. Over 5+ years, he has worked across computer vision models, L5 autonomous vehicle systems, and LLM research, with a focus on taking complex AI ideas into real-world engineering systems.

His work and writing cover AI systems, large language models, AI agents, multimodal systems, autonomous systems, inference optimization, RAG, evaluation, and production AI engineering.