Expressive power and complexity in algebraic logic

Journal of Logic and Computation

Volumn 7, Issue 3, 1997, Pages 309-351

  Hirsch, Robin ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

Complexity; Cylindric algebra; Interpretation; Network satisfaction problem; Relation algebra

Indexed keywords

EID: 0004414447     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/7.3.309     Document Type: Article

References (48)

1. H. Andréka, S. Givant and I. Németi. Decision problems for equational theories of relation algebras. Bulletin of Section of Logic, 1, 1994.
2. J. F. Allen and P. J. Hayes. A commonsense theory of time. In Proceedings of the International Conference on Artificial Intelligence, A. Joshi, ed. pp. 528-531. Morgan Kaufmann, 1985.
3. J. F. Allen and P. J. Hayes. Moments and points in an interval-based temporal logic. Technical Report TR180, Department of Computer Science, University of Rochester, 1985.
4. A. Aho, J. Hopcroft and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
5. J. F. Allen and H. Kautz. A model of naïve temporal reasoning. In Contributions to Artificial Intelligence, Vol. 1, R. Moore and J. Hobbs, eds. Ablex, Norwood, NJ, 1983.
6. J. F. Allen and J. Koomen. Planning using a temporal world model. Proceedings of the 8th International Conference on Artificial Intelligence, pp. 711-714. Morgan Kaufmann, 1983.
7. J. F. Allen. An interval-based representation of temporal knowledge. In Proceedings of the 7th International Conference on Artificial Intelligence, August 1981. Morgan Kaufmann.
8. J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26, 832-843, 1983.
9. J. F. Allen. Towards a general theory of action and time. Artificial Intelligence, 23, 123-154, 1984.
10. H. Andréka and R. Maddux. Representations for small relation algebras. Notre Dame Journal of Formal Logic, 35, 550-562, 1994.
11. H. Andréka, J. D. Monk and I. Németi. Algebraic Logic. North-Holland, 1991.
12. S. Comer. A remark on chromatic polygroups. Congr. Numer., pp. 85-95, 1983.
13. I. Düntsch. Small integral relation algebras generated by a partial order. Periodica Mathematica Hungaria. 129-138, 1991.
14. T. Dean and D. McDermott. Temporal database management. Artificial Intelligence, 32, 1-55, 1987.
15. R. Dechter, I. Mein and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49, 61-95, 1991.
16. R. Hirsch and I. Hodkinson. Complete representations in algebraic logic. Journal of Symbolic Logic, 1996, to appear.
17. R. Hirsch and I. Hodkinson. Step by step - building representations in algebraic logic. Journal of Symbolic Logic, 1996, to appear.
18. R. Hirsch. From points to intervals. Journal of Applied Non-Classical Logics, 4, 7-27, 1994.
19. R. Hirsch. Relation Algebras of Intervals. PhD thesis, Imperial College, 1994.
20. R. Hirsch. Intractability in the Allen & Koomen planner. Computational Intelligence Journal, 11, 553-564, 1995.
21. R. Hirsch. Relation algebras of intervals. Artificial Intelligence Journal, 83, 1-29, 1996.
22. L. Henkin, J. D. Monk and A. Tarski. Cylindric Algebras Part I. North-Holland, 1971.
23. L. Henkin, J. D. Monk and A. Tarski. Cylindric Algebras Part II. North-Holland, 1985.
24. W. Hodges. Model Theory. Encyclopedia of Mathematics and its Applications, Cambridge University Press, 1995. Second reprint.
25. B. Jónsson. Varieties of relation algebras. Algebra Universalis, 15, 273-298, 1982.
26. B. Jónsson. The theory of binary relations. In Algebraic Logic, H. Andréka, J. D. Monk and I. Németi, eds. pp. 245-292. North Holland, 1991.
27. B. Jónsson and A. Tarski. Representation problems for relation algebras. Bulletin of the American Mathematical Society, 54, 1948.
28. H. Kautz and P. Ladkin. Integrating metric and qualitative temporal reasoning. In Proceedings of the Ninth National Conference on Artificial Intelligence, Angeim, California, pp. 241-246. The MIT Press, Cambridge, MA. 1991.
29. J. Koomen. Localising temporal constraint propagation. In Proceedings of the First Conference on Principles of Knowledge Representation and Reasoning, Brachman, Levesque and Reiter, eds. pp. 198-202. Morgan Kaufmann, 1989.
30. H. Kautz and M. Vilain. Constraint propagation algorithms for temporal reasoning. In Proceedings of the Fifth National Conference on Artificial Intelligence, pp. 377-382. 1986.
31. G. Ligozat. Tractable relations in temporal reasoning: pre-convex relations. In ECAI-94, Proceedings on Spatial and Temporal Reasoning, Amsterdam, August 1994, Neumman, ed. John Wiley and Sons.
32. P. Ladkin and R. Maddux. On binary constraint networks. Technical Report KES.U.88.8, The Kestrel Institute, 1988.
33. P. Ladkin and R. Maddux. On binary constraint problems. Journal of the American Mathematical Society, 1993.
34. P. Ladkin and R. Maddux. On binary constraint problems. Journal of the Association of Computing Machinery, 41, 435-469, 1994.
35. P. Ladkin and A. Reinefeld. A symbolic approach to interval constraint problems. Artificial Intelligence and Symbolic Mathematical Computing, 737, 65-84, 1993.
36. R. Lyndon. The representation of relational algebras. Annals of Mathematics, 51, 707-729, 1950.
37. R. Maddux. Introductory course on relation algebras, finite-dimensional cylindric algebras, and their interconnections. In Algebraic Logic, H. Andréka, J. D. Monk and I. Meméti, eds. pp. 361-392. North-Holland, 1991.
38. R. Maddux. The origin of relation algebras in the development and axiomatization of the calculus of relations. Studia Logica, 3/4, 421-455, 1991.
39. R. McKenzie. The Representation of Relation Algebras. PhD thesis, University of Colorado at Boulder, 1966.
40. J. D. Monk. On representable relation algebras. Michigan Mathematics Journal, 11, 207-210, 1964.
41. B. Nebel and H.-J. Bürckert. Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. In Proceedings of the 12th National Conference of the American Association for Artificial Intelligence, Seattle, WA, July 1994. pp. 356-361. The MIT Press, Cambridge, MA.
42. R. Pelavin. A Formal Approach to Planning with Concurrent Actions and External Events. PhD thesis, University of Rochester, 1988.
43. M. Stone. The theory of representations for Boolean algebras. Transactions of the American Mathematical Society, 40, 37-111, 1936.
44. A. Tarski and S. Givant. A Formalization of Set Theory Without Variables. American Mathematics Society, 1987.
45. P. van Emde Boas. Machine models and simulations. In Handbook of Theoretical Computer Science, J. van Leeuwen, ed. pp. 1-61. The MIT Press, Cambridge, MA, 1994.
46. M. Villain and H. Kautz. Constraint propagation algorithms for temporal reasoning. In Proceedings of the Fifth AAAI. pp. 377-382, 1986.
47. M. Villain, H. Kautz and P. van Beek. Constraint propagation algorithms for temporal reasoning - a revised report. Readings in Qualitative Reasoning about Physical Systems, 373-381, 1989.
48. J. van Leeuwen. Handbook of Theoretical Computer Science. The MIT Press, Cambridge, MA, 1994.