The Boundary between Decidability and Undecidability for Transitive-Closure Logics (2004)
Cached
Download Links
- [www.cs.tau.ac.il]
- [www.math.tau.ac.il]
- [www.cs.umass.edu]
- DBLP
Other Repositories/Bibliography
by
N. Immerman
,
A. Rabinovich
,
T. Reps
,
M. Sagiv
,
G. Yorsh
| Venue: | In Computer Science Logic (CSL |
| Citations: | 27 - 4 self |
BibTeX
@INPROCEEDINGS{Immerman04theboundary,
author = {N. Immerman and A. Rabinovich and T. Reps and M. Sagiv and G. Yorsh},
title = {The Boundary between Decidability and Undecidability for Transitive-Closure Logics},
booktitle = {In Computer Science Logic (CSL},
year = {2004},
pages = {160--174}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from a program's variables. On the other hand, with a few notable exceptions, adding transitive closure to even very tame logics makes them undecidable. In this paper, we explore...
