## Relation algebras for reasoning about time and space (1994)

### Cached

### Download Links

- [www.math.iastate.edu]
- [www.math.iastate.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Algebraic Methodology and Software Technology, Enschede 1993, Workshops in Computing Series |

Citations: | 5 - 0 self |

### BibTeX

@INPROCEEDINGS{Maddux94relationalgebras,

author = {Roger D. Maddux},

title = {Relation algebras for reasoning about time and space},

booktitle = {Algebraic Methodology and Software Technology, Enschede 1993, Workshops in Computing Series},

year = {1994},

pages = {27--44},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

This paper presents a brief introduction to relation algebras, including some examples motivated by work in computer science, namely, the ‘interval algebras’, relation algebras that arose from James Allen’s work on temporal reasoning, and by ‘compass algebras’, which are designed for similar reasoning about space. One kind of reasoning problem, called a ‘constraint satisfaction problem’, can be defined for arbitrary relation algebras. It will be shown here that the constraint satisfiability problem is NP-complete for almost all compass and interval algebras.