{'fraction_non_alphanumeric': 0.02364607170099161, 'fraction_numerical': 0.0, 'mean_word_length': 5.218009478672986, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A unifying logic-based formalism for semantic data models

Contrary to the Relational, Hierarchical, and Network Data Models which represent an application's semantics implicitly in a particular data structure, Semantic Data Models implement well-known data abstractions (i.e. aggregation, isa, association, and collection) in order to represent the semantics explicitly. A common formalism represents a framework in which data model formalisms can be transcribed and provides a uniformity useful for theoretical investigations. In this paper a first-order logic is introduced as a common formalism for analyzing Semantic Data Models. A schema is viewed as a first-order theory and the database as a model of this theory. 
Relations in the logic correspond to the data abstractions mentioned and axioms are given which describe their properties. Every schema contains these 'general' axioms in addition to those specific to the real-world application. The presence of the 'general' axioms provides a logical environment in which schemas can be developed. 
Exploiting its proof theory, the logic provides a natural mechanism with which schema consistency and schema information content are examined. The notion of a semantic database domain is introduced to provide a set-theoretic basis for the logic formalism.