Negation-Closure for JSON Schema
Mohamed-Amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo Sartiani,, Stefanie Scherzinger

TL;DR
This paper investigates the negation capabilities of JSON Schema, revealing limitations in negation closure, analyzing recent draft updates, and proposing an algebraic reformulation to enhance the language's expressiveness.
Contribution
It identifies the lack of negation closure in JSON Schema, analyzes recent updates, and introduces an algebraic reformulation to improve its logical expressiveness.
Findings
JSON Schema lacks negation closure in its current form.
Recent draft versions have not fully addressed negation limitations.
An algebraic reformulation enables better schema reasoning and witness generation.
Abstract
JSON Schema is an evolving standard for describing families of JSON documents. It is a logical language, based on a set of assertions that describe features of the JSON value under analysis and on logical or structural combinators for these assertions, including a negation operator. Most logical languages with negation enjoy negation closure, that is, for every operator they have a negation dual that expresses its negation. We show that this is not the case for JSON Schema, we study how that changed with the latest versions of the Draft, and we discuss how the language may be enriched accordingly. In the process, we define an algebraic reformulation of JSON Schema, which we successfully employed in a prototype system for generating schema witnesses.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNatural Language Processing Techniques · Topic Modeling · Mathematics, Computing, and Information Processing
