534 search results - page 56 / 107 » Proving Termination of Rewrite Systems Using Bounds |
LICS
1997
IEEE
13 years 12 months ago
1997
IEEE
Abstract. We prove that ground reducibility is EXPTIME-complete in the general case. EXPTIME-hardness is proved by encoding the emptiness problem for the intersection of recognizab...
NIPS
2007
13 years 9 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
FOSSACS
2004
Springer
14 years 1 months ago
2004
Springer
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are annotated with lower time bounds, with respect to speed. Their paper has left o...
IACR
2011
12 years 7 months ago
2011
Abstract. Radio Frequency Identification (RFID) systems are vulnerable to relay attacks (i.e., mafia, terrorist and distance frauds) when they are used for authentication purpose...
IJCAI
2003
13 years 9 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...