{'fraction_non_alphanumeric': 0.0223463687150838, 'fraction_numerical': 0.0, 'mean_word_length': 5.286549707602339, '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}}
Temporal Qualification and Change with First-Order Binary Predicates

Some temporal ontologies require a way of enforcing the temporal qualification of certain assertions---those about changing entities. In a knowledge representation language based on first--order logic, this is straightforwardly done by having a category of temporal regions and augmenting predicates with an additional argument place for the time at which a given predicate holds. 
 
Here, I address the problem of representing entities changing over time and enforcing temporal qualification in first--order languages with predicates at most binary. It is possible, I argue, using temporal entities known as perdurants (events or processes)---towards which binary languages seem prima facie biased. There is however virtually no ontological cost for an ontology which in addition to changing entities recognizes changes, events and processes. Temporal knowledge representation therefore is not a lost cause even with languages with syntax and semantics limited to the representation of binary relations.