New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols (2003)
Cached
Download Links
- [www.lsv.ens-cachan.fr]
- [www.lsv.ens-cachan.fr]
- DBLP
Other Repositories/Bibliography
by
H. Comon-Lundh
,
V. Cortier
| Citations: | 35 - 15 self |
BibTeX
@MISC{Comon-Lundh03newdecidability,
author = {H. Comon-Lundh and V. Cortier},
title = {New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols},
year = {2003}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We consider a new extension of the Skolem class for first-order logic and prove its decidability by resolution techniques. We then extend this class including the built-in equational theory of exclusive or. Again, we prove the decidability of the class by resolution techniques.
