Temporal Qualification and Change with First--Order Binary Predicates

Authors:
Pierre Grenon
Affiliations:
IFOMIS, Saarland University, Germany and Department of Philosophy, University of Geneva, Switzerland
Venue:
Proceedings of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006)
Year:
2006

Citing 3
Cited 2

Temporal logic (vol. 1): mathematical foundations and computational aspects

Temporal logic (vol. 1): mathematical foundations and computational aspects
Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project

Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project
Introducing Temporal Description Logics

TIME '99 Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning

Logical properties of foundational mereogeometrical relations in bio-ontologies

Applied Ontology
Towards a formal ontology for history of church administration

Proceedings of the 2010 conference on Formal Ontology in Information Systems: Proceedings of the Sixth International Conference (FOIS 2010)

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.