1716 search results - page 15 / 344 » Proving Conditional Termination |
CLIMA
2004
13 years 9 months ago
2004
In this paper we propose a formal specification of a persuasion protocol between autonomous agents using an approach based on social commitments and arguments. In order to be flexi...
ERSHOV
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present an algorithm for generating all polynomial invariants of Psolvable loops with assignments and nested conditionals. We prove termination of our algorithm. The p...
LPAR
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. The main goal of this paper is to apply rewriting termination technology —enjoying a quite mature set of termination results and tools— to the problem of proving auto...
IANDC
2008
13 years 7 months ago
2008
The main goal of this paper is to apply rewriting termination technology --enjoying a quite mature set of termination results and tools-- to the problem of proving automatically t...
CAISE
2003
Springer
14 years 21 days ago
2003
Springer
This paper presents an algorithm for termination static analysis of active rules with priorities. Active rules termination is an undecidable problem. Several recent works have sugg...