Relation algebras of intervals

Artificial Intelligence

Volumn 83, Issue 2, 1996, Pages 267-295

  Hirsch, Robin ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; LEARNING SYSTEMS;

INTERVALS; RELATION ALGEBRAS;

BOOLEAN ALGEBRA;

EID: 0030166929     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/0004-3702(95)00042-9     Document Type: Article

References (30)

1. J.F. Allen, Maintaining knowledge about temporal intervals, Commun. ACM 26 (1983) 832-843.
2. J.F. Allen and J. Koomen, Planning using a temporal world model, Int. J. Comput. Artif. Intell. 8 (1983) 711-714.
3. H. Andréka, On the representation problem of distributive semilattice-ordered semigroups, Preprint, Mathematics Institute, Hungarian Academy of Science, Budapest (1989).
4. H. Andréka, D. Monk and I. Németi, Algebraic Logic (North-Holland, Amsterdam, 1991).
5. L. Chin and A. Tarski, Distributive and modular laws in the arithmetic of relation algebras, Univ. California Publ. Math. N.S. 1 (1951) 341-384.
6. R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks, Artif. Intell. 49 (1991) 61-95.
7. R. Hirsch, Relation algebras of intervals, Ph.D. Thesis, Imperial College, London (1994).
8. R. Hirsch and I. Hodkinson, Step by step - building representations in algebraic logic, J. Symbolic Logic (to appear).
9. B. Jónsson, Varieties of relation algebras, Algebra Universal 15 (1982) 273-298.
10. B. Jónsson, The theory of binary relations, in: H. Andréka, D. Monk and I. Németi, eds., Algebraic Logic (North-Holland, Amsterdam, 1991) 245-292.
11. B. Jónsson and A. Tarski, Representation problems for relation algebras, Bull. Am. Math. Soc. 54 (1948).
12. B. Jónsson and A. Tarski, Boolean algebras with operators, Am. J. Math. 73 (1951) 891-939.
13. H. Kautz and P. Ladkin, Integrating metric and qualitative temporal reasoning, in: Proceedings AAAI-91, Anaheim, CA (1991) 241-246.
14. P. Ladkin, Metric constraint satisfaction with intervals, Tech. Rept. TR-89-083, ICSI, Berkeley, CA (1989).
15. P. Ladkin and R. Maddux, The algebra of convex time intervals, Tech. Rept., The Kestrel Institute, Palo Alto, CA (1987).
16. P. Ladkin and R. Maddux, On binary constraint networks, Tech. Rept. KES.U.88.8, The Kestrel Institute, Palo Alto, CA (1988) 76.
17. P. Ladkin and R. Maddux, On binary constraint problems, J. ACM 4 (1994) 435-469.
18. G. Ligozat, Weak representation of interval algebras, in: Proceedings AAAI-90, Boston, MA (1990) 715-720.
19. R. Lyndon, The representation of relational algebras, Ann. Math. 51 (1950) 707-729.
20. R. Lyndon, The representation of relation algebras, II, Ann. Math. 63 (1956) 294-307.
21. R.D. Maddux, Non-finite axiomatizability results for cylindric and relation algebras, J. Symbolic Logic 54 (1989) 951-974.
22. R. Maddux, The origin of relation algebras in the development and axiomatization of the calculus of relations, Studio Logica 3/4 (1991).
23. I. Meiri, Combining qualitative and quantitative constraints in temporal reasoning, Tech. Rept. R-160, UCLA, Los Angeles, CA (1991).
24. D. Monk, On representable relation algebras, Michigan Math. J. 11 (1964) 207-210.
25. I. Németi, Algebraisations of quantifier logics, an introductory overview, Stud. Logica 50 (1991) 485-570.
26. A. Tarski, Contributions on the theory of models, Proc. Koninkl. Nederl. Akad. Wetensch. Ser. A 57 (1954) 572-588; 58 (1955) 56-64.
27. A. Tarski, Contributions on the theory of models, Proc. Koninkl. Nederl. Akad. Wetensch. Ser. A 57 (1954) 572-588; 58 (1955) 56-64.
28. J. van Benthem, The Logic of Time (Reidel, Dordrecht, Netherlands, 1983).
29. M. Villain and H. Kautz, Constraint propagation algorithms for temporal reasoning, in: Knowledge Representation (1986) 377-382.
30. M. Villain, H. Kautz and P. van Beek, Constraint propagation algorithms for temporal reasoning - a revised report, in: Readings in Qualitative Reasoning about Physical Systems (Morgan Kaufmann, Los Altos, CA, 1989) 373-381.