The Time Ontology of Allen's Interval Algebra
暂无分享,去创建一个
Allen’s interval algebra is a set of thirteen jointly exhaustive and pairwise disjoint binary relations representing temporal relationships between pairs of time intervals. Despite widespread use, there is still the question of which time ontology actually underlies Allen’s algebra. Early work specified a first-order ontology that can interpret Allen’s interval algebra; in this paper, we identify the first-order ontology that is logically synonymous with Allen’s interval algebra, so that there is a one-to-one correspondence between models of the ontology and solutions to temporal constraints that are specified using the temporal relations. We further prove a representation theorem for the ontology, thus characterizing its models up to isomorphism. 1998 ACM Subject Classification I.2.4 Knowledge Representation Formalisms and Methods
[1] B. Bennett,et al. When does a Composition Table Provide a Complete and TractableProof Procedure for a Relational Constraint Language ? , 1997 .
[2] Patrick J. Hayes,et al. Moments and points in an interval‐based temporal logic , 1989, Comput. Intell..
[3] Torsten Hahmann,et al. Modular first-order ontologies via repositories , 2012, Appl. Ontology.
[4] Herbert B. Enderton,et al. A mathematical introduction to logic , 1972 .