Towards a general theory of action and time
Artificial Intelligence
A logic-based calculus of events
New Generation Computing
Reasoning about change: time and causation from the standpoint of artificial intelligence
Reasoning about change: time and causation from the standpoint of artificial intelligence
A critical examination of Allen's theory of action and time
Artificial Intelligence
Proceedings of the first international conference on Principles of knowledge representation and reasoning
ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics
A critique of Yoav Shoham's theory of causal reasoning
AAAI'91 Proceedings of the ninth National conference on Artificial intelligence - Volume 1
A new unification method for temporal reasoning with constraints
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Ontology design patterns for semantic web content
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Temporal representation and reasoning in artificial intelligence: A review
Mathematical and Computer Modelling: An International Journal
A type-theoretical approach for ontologies: The case of roles
Applied Ontology
Hi-index | 0.00 |
Reification of propositions expressing states, events, and properties has been widely advocated as a means of handling temporal reasoning in AI. The author proposes that such reification is both philosophically suspect and technically unnecessary. The reified theories of Allen and Shoham are examined and it is shown how they can be unreified. The resulting loss of expressive power can be rectified by adopting Davidson's theory in which event tokens, rather than event types, are reified. This procedure is illustrated by means of Kowalski and Sergot's Event Calculus, the additional type-reification of the latter system being excised by means of a general procedure proposed by the author for converting type-reification into token-reification. Some examples are given to demonstrate the expressive power of the resulting theory.