Relations algebras in qualitative spatial reasoning

Fundamenta Informaticae

Volumn 39, Issue 3, 1999, Pages 229-248

  Düntsch, Ivo ^a   Wang, Hui ^a   McCloskey, Stephen ^a  

^a UNIVERSITY OF ULSTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17644434140     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1999-39301     Document Type: Article

References (57)

1. Allen, J. F. (1983). Maintaining knowledge about temporal intervals. Communications of the ACM, 26, 832-843.
2. Andréka, H., Düntsch, I. & Németi, I. (1995). Expressibility of properties of relations. Journal of Symbolic Logic, 60, 970-991.
3. Andréka, H., Givant, S. & Németi, I. (1994). The lattice of varieties of representable relation algebras. Journal of Symbolic Logic, 59, 631-661.
4. Andréka, H., Monk, J. D. & Németi, I. (Eds.) (1991). Algebraic Logic, vol. 54 of Colloquia Mathematica Societatis János Bolyai. Amsterdam: North Holland.
5. Andréka, H., Németi, I. & Sain, I. (1998). Algebraic logic. Mathematical Institute, Hungarian Academy of Sciences.
6. Asher, N. & Vieu, L. (1995). Toward a geometry of common sense: A semantics and a complete axiomatization of mereotopology. In C. Mellish (Ed.), IJCAI95, Proceedings of the 14th International Joint Conference on Artificial Intelligence.
7. Bennett, B., Isli, A. & Cohn, A. (1997). When does a composition table provide a complete and tractable proof procedure for a relational constraint language? In IJCAI 97, Proceedings of the 15th International Joint Conference on Artificial Intelligence.
8. Biacino, L. & Gerla, G. (1991). Connection structures. Notre Dame Journal of Formal Logic, 32, 242-247.
9. Birkhoff, G. (1948). Lattice Theory, vol. 25 of Am. Math. Soc. Colloquium Publications. Providence: AMS, 2nd Edn.
10. Chin, L. & Tarski, A. (1951). Distributive and modular laws in the arithmetic of relation algebras. University of California Publications, 1, 341-384.
11. Clarke, B. L. (1981). A calculus of individuals based on 'connection'. Notre Dame Journal of Formal Logic, 22, 204-218.
12. Cohn, A. G. (1997). Qualitative spatial representation and reasoning techniques. Research report, School of Computer Studies, University of Leeds.
13. Cohn, A. G., Bennett, B., Gooday, J. & Gotts, N. M. (1997). Qualitative spatial representation and reasoning with the region connection calculus. Geoinformatica, 13, pp 1-42.
14. Comer, S. (1983). A remark on chromatic polygroups. Congressus Numerantium, 38, 85-95.
15. Comer, S. (1993). On connections between information systems, rough sets, and algebraic logic. In C. Rauszer (Ed.), Algebraic Methods in Logic and Computer Science, vol. 28 of Banach Center Publications, 117-124. Warszawa: Polish Academy of Science.
16. Cunningham, P. & Brady, M. (1987). Qualitative reasoning in electronic fault diagnosis. In IJCAI 87, Proceedings of the 10th International Joint Conference on Artificial Intelligence, 443-445.
17. de Morgan, A. (1864). On the syllogism: IV, and on the logic of relations. Transactions of the Cambridge Philosophical Society, 10, 331-358. (read April 23, 1860) Reprinted in de Morgan (1966).
18. de Morgan, A. (1966). On the Syllogism, and Other Logical Writings. New Haven: Yale Univ. Press.
19. Düntsch, I. (1991). Small integral relation algebras generated by a partial order. Period. Math. Hungar., 23, 129-138.
20. Düntsch, I. (1994). Rough relation algebras. Fundamenta Informaticae, 21, 321-331.
21. Düntsch, I. & Gediga, G. (1997). Relation restricted prediction analysis. In A. Sydow (Ed.), Proc. 15th IMACS World Congress, Berlin, vol. 4, 619-624, Berlin. Wissenschaft und Technik Verlag.
22. Düntsch, I. & Orłowska, E. (1999a). Modal logics for frames with contact relations. In progress.
23. Düntsch, I. & Orłowska, E. (1999b). A sound and complete proof system for contact relation algebras. Preprint.
24. Düntsch, I., Wang, H. & McCloskey, S. (1999a). A relation algebraic approach to the Region Connection Calculus. Theoretical Computer Science. To appear.
25. Düntsch, I., Winter, M. & Schmidt, G. (1999b). Relation algebras for mereotopology. In progress.
26. Hirsch, R. (1997). Expressive power and complexity in algebraic logic. Journal of Logic and Computation, 7, 309-351.
27. Jipsen, P. (1992). Computer aided investigations of relation algebras. Ph.D. thesis, Vanderbilt University.
28. Jónsson, B. (1982). Varieties of relation algebras. Algebra Universalis, 15, 273-298.
29. Jónsson, B. (1984). Maximal algebras of binary relations. Contemporary Mathematics, 33, 299-307.
30. Jónsson, B. (1991). The theory of binary relations. In Andréka et al. (1991), 245-292.
31. Jonsson, P. & Drakengren, T. (1997). A complete classification of tractability in RCC-5. Journal of Artificial Intelligence Research, 6, 211-222.
32. Koppelberg, S. (1989). General Theory of Boolean Algebras, vol. 1 of Handbook on Boolean Algebras. North Holland.
33. Ladkin, P. B. & Maddux, R. D. (1994). On binary constraint problems. Journal of the ACM, 41, 435-469.
34. Leonard, H. S. & Goodman, N. (1940). The calculus of individuals and its uses. Journal of Symbolic Logic, 5, 45-55.
35. Leśniewski, S. (1927-1931). O podstawach matematyki. Przeglad Filozoficzny, 30-34.
36. Leśniewski, S. (1983). On the foundation of mathematics. Topoi, 2, 7-52.
37. Luschei, E. C. (1962). The Logical Systems of Leśniewski. Amsterdam: North Holland.
38. Lyndon, R. C. (1950). The representation of relational algebras. Annals of Mathematics (2), 51, 707-729.
39. Nebel, B. & Bürckert, H.-J. (1993). Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. Research Report RR-93-11, German Research Center for Artificial Intelligence (DFKI), Saarbrücken, Germany.
40. Peirce, C. S. (1870). Description of a notation for the logic of relatives, resulting from an amplification of the conceptions of Boole's calculus of logic. Memoirs of the American Academy of Sciences, 9, 317-378. Reprint by Welch, Bigelow and Co., Cambridge, Mass., 1870, pp. 1-62.
41. Polkowski, L. & Skowron, A. (1996). Rough mereology: A new paradigm for approximate reasoning. Int J of Approximate Reasoning, 15, 333-365.
42. Pratt, I. & Schoop, D. (1998). A complete axiom system for polygonal mereotopology of the real plane. Journal of Philosophical Logic, 27, 621-658.
43. Pratt, I. & Schoop, D. (1999). Expressivity in polygonal, plane mereotopology. Journal of Symbolic Logic. To appear.
44. Randell, D. A., Cohn, A. & Cui, Z. (1992). Computing transitivity tables: A challenge for automated theorem provers. In Proc CADE 11, 786-790. Springer Verlag.
45. Renz, J. & Nebel, B. (1997). On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. In IJCAI 97, Proceedings of the 15th International Joint Conference on Artificial Intelligence.
46. Renz, J. & Nebel, B. (1998). Efficient methods for qualitative spatial reasoning. In H. Prade (Ed.), Proceedings of the 13th European Conference on Artificial Intelligence, ECAI'98, 562-566. Wiley.
47. Schröder, E. (1890-1905). Vorlesungen über die Algebra der Logik, Volumes 1 to 3. Leipzig: Teubner. Reprinted by Chelsea, New York, 1966.
48. Surma, S. J., Srzednicki, J. T., Barnett, D. I. & Ricky, V. F. (Eds.) (1992). Stanislaw Leśniewski: Collected works.
49. Tarski, A. (1929). Les fondements de la géométrie du corps. Ksiȩga Pamia̧tkowa Pierwszego Polskiego Zjazdu Matematycznego, 29-33. Summary of an address given to the First Polish Mathematical Congress, Lwów, 1927. English translation in J. H. Woodger (Ed.) (1956) Logic, Semantics, Metamathematics, Clarendon Press.
50. Tarski, A. (1935). Zur Grundlegung der Boole'schen Algebra, I. Fundamenta Mathematicae, 24, 177-198.
51. Tarski, A. (1937). Appendix E to J.H. Woodger's "The Axiomatic Method in Biology". 161-172. Cambridge: University Press.
52. Tarski, A. (1941). On the calculus of relations. J. Symbolic Logic, 6, 73-89.
53. Tarski, A. & Givant, S. (1987). A formalization of set theory without variables, vol. 41 of Colloquium Publications. Providence: Amer. Math. Soc.
54. van Benthem, J. (1983). The logic of time. Reidel.
55. Whitehead, A. N. (1929). Process and reality. New York: MacMillan.
56. Wielandt, H. (1964). Finite permutation groups. Academic Press.
57. Worboys, M. (1998). Imprecision in finite resolution spatial data. GeoInformatica, 1.