Negation-closure for JSON Schema

Mohamed Amine Baazizi; Dario Colazzo; Giorgio Ghelli; Carlo Sartiani; Stefanie Scherzinger

doi:10.1016/j.tcs.2023.113823

Negation-closure for JSON Schema

Mohamed Amine Baazizi, Dario Colazzo, Giorgio Ghelli, Carlo Sartiani, Stefanie Scherzinger

Research output: Contribution to journal › Article › peer-review

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: for every operator, they have a negation-dual that allows negation to be pushed through the operator. We show that this is not the case for JSON Schema, study how that changed with the latest versions of the Draft, and discuss how the language may be enriched accordingly. To this aim, we exploit an algebraic reformulation of JSON Schema, which is helpful for the formal manipulation of the language.

Original language	English
Article number	113823
Journal	Theoretical Computer Science
Volume	955
DOIs	https://doi.org/10.1016/j.tcs.2023.113823
Publication status	Published - 26 Apr 2023
Externally published	Yes

Keywords

JSON Schema
Negation closure
Schema languages

Access to Document

10.1016/j.tcs.2023.113823

Cite this

@article{60dadfa4a2694ec58f16b035076526f9,

title = "Negation-closure for JSON Schema",

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: for every operator, they have a negation-dual that allows negation to be pushed through the operator. We show that this is not the case for JSON Schema, study how that changed with the latest versions of the Draft, and discuss how the language may be enriched accordingly. To this aim, we exploit an algebraic reformulation of JSON Schema, which is helpful for the formal manipulation of the language.",

keywords = "JSON Schema, Negation closure, Schema languages",

author = "Baazizi, \{Mohamed Amine\} and Dario Colazzo and Giorgio Ghelli and Carlo Sartiani and Stefanie Scherzinger",

note = "Publisher Copyright: {\textcopyright} 2023 Elsevier B.V.",

year = "2023",

month = apr,

day = "26",

doi = "10.1016/j.tcs.2023.113823",

language = "English",

volume = "955",

journal = "Theoretical Computer Science",

issn = "0304-3975",

}

TY - JOUR

T1 - Negation-closure for JSON Schema

AU - Baazizi, Mohamed Amine

AU - Colazzo, Dario

AU - Ghelli, Giorgio

AU - Sartiani, Carlo

AU - Scherzinger, Stefanie

PY - 2023/4/26

Y1 - 2023/4/26

N2 - 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: for every operator, they have a negation-dual that allows negation to be pushed through the operator. We show that this is not the case for JSON Schema, study how that changed with the latest versions of the Draft, and discuss how the language may be enriched accordingly. To this aim, we exploit an algebraic reformulation of JSON Schema, which is helpful for the formal manipulation of the language.

AB - 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: for every operator, they have a negation-dual that allows negation to be pushed through the operator. We show that this is not the case for JSON Schema, study how that changed with the latest versions of the Draft, and discuss how the language may be enriched accordingly. To this aim, we exploit an algebraic reformulation of JSON Schema, which is helpful for the formal manipulation of the language.

KW - JSON Schema

KW - Negation closure

KW - Schema languages

U2 - 10.1016/j.tcs.2023.113823

DO - 10.1016/j.tcs.2023.113823

M3 - Article

AN - SCOPUS:85151040095

SN - 0304-3975

VL - 955

JO - Theoretical Computer Science

JF - Theoretical Computer Science

M1 - 113823

ER -

Negation-closure for JSON Schema

Abstract

Keywords

Access to Document

Fingerprint

Cite this