This paper presents a method for representing temporal interval relations using a bit-encoded form of the relationships between interval end points. The set of bit patterns for each interval relationship yields a unique, single-byte signature that forms the basis of a binary temporal algebra. Also p
β¦ LIBER β¦
R. Hirsch, Relation algebras of intervals
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 92 KB
- Volume
- 83
- Category
- Article
- ISSN
- 0004-3702
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An interval-based temporal algebra based
β
Vincent J. Kovarik Jr.; Avelino J. Gonzalez
π
Article
π
2000
π
John Wiley and Sons
π
English
β 287 KB
Intervals of Binary Relations
β
David W. H. Gillam
π
Article
π
1979
π
John Wiley and Sons
π
English
β 284 KB
Relation algebras: Concept of points and
β
G. Schmidt; T. StrΓΆhlein
π
Article
π
1985
π
Elsevier Science
π
English
β 621 KB
In the axiomatization of relation algebras by Chin and Tarski certain elements are called fight ideals. Aiming at applications in the relational theory of graphs and programs, we call such ideals 'points' and investigate an additional point axiom. First we prove a point insertion theorem. Then a rep
Maps between representations of zero-rel
β
W.W Crawley-Boevey
π
Article
π
1989
π
Elsevier Science
π
English
β 265 KB
A Classification of Simple Limits of Spl
β
Xinhui Jiang; Hongbing Su
π
Article
π
1997
π
Elsevier Science
π
English
β 477 KB
Let A be a unital simple limit of finite direct sums of sub-homogeneous interval algebras of a certain type (cf. Definition 1.1). It is proved that A can be classified by the scaled ordered group K 0 (A), the simplex T(A), and the canonical pairing between them. It is also shown that K 0 (A) might f
On the cyclic homology of monomial relat
β
Kiyoshi Igusa; Dan Zacharia
π
Article
π
1992
π
Elsevier Science
π
English
β 1010 KB