JSON Schema is an evolving standard for the description of families of JSON documents. JSON Schema 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. As for any logical language, problems like satisfaction, not-elimination, schema satisfiability, schema inclusion and equivalence, as well as witness generation, have both theoretical and practical interest. While satisfaction is trivial, all other problems are quite difficult, due to the combined presence of negation, recursion, and complex assertions in JSON Schema. To make things even more complex and interesting, JSON Schema is not algebraic, since we have both syntactic and semantic interactions between different keywords in the same schema object. With such motivations, we present in this paper an algebraic characterization of JSON Schema, obtained by adding opportune operators, and by mirroring existing ones. We present then algebra-based approaches for dealing with not-elimination and witness generation problems, which play a central role as they lead to solutions for the other mentioned complex problems.

中文翻译：

---

不消除和见证JSON架构

JSON模式是用于描述JSON文档系列的不断发展的标准。JSON模式是一种逻辑语言，它基于描述分析中JSON值特征的一组断言以及这些断言的逻辑或结构组合器。对于任何逻辑语言，诸如满意度，不消除，图式可满足性，图式包含和等效性以及证人生成等问题都具有理论和实践意义。尽管满意度微不足道，但由于JSON Schema中存在否定，递归和复杂的断言，因此所有其他问题都非常困难。为了使事情变得更加复杂和有趣，JSON Schema不是代数的，因为我们在同一模式对象中的不同关键字之间具有语法和语义上的交互。有了这样的动机，我们在本文中介绍了JSON模式的代数表征，它是通过添加适当的运算符并镜像现有运算符而获得的。然后，我们介绍了基于代数的方法来处理非消除和见证生成问题，这些方法在解决其他提到的复杂问题方面起着至关重要的作用。