SCAN is complete for all Sahlqvist formulae (2004)
Cached
Download Links
- [www.csc.liv.ac.uk]
- [www.csc.liv.ac.uk]
- [www.cs.man.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | In Relational and Kleene-Algebraic Methods in Computer Science (RelMiCS 7 |
| Citations: | 3 - 1 self |
BibTeX
@INPROCEEDINGS{Goranko04scanis,
author = {V. Goranko and U. Hustadt and R. A. Schmidt and D. Vakarelov},
title = {SCAN is complete for all Sahlqvist formulae},
booktitle = {In Relational and Kleene-Algebraic Methods in Computer Science (RelMiCS 7},
year = {2004},
pages = {149--162},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. SCAN is an algorithm for reducing monadic existential second-order logic formulae to equivalent simpler formulae, often first-order logic formulae. It is provably impossible for such a reduction to first-order logic to be always successful, even if there is an equivalent first-order formula for a second-order logic formula. In this paper we show that SCAN successfully computes the first-order equivalents of all Sahlqvist formulae in the classical (multi-)modal language. 1
