1716 search results - page 54 / 344 » Proving Conditional Termination |
202
click to vote
JAR
2010
15 years 1 months ago
2010
Based on inductive definitions, we develop a tool that automates the definition of partial recursive functions in higher-order logic (HOL) and provides appropriate proof rules for ...
192
click to vote
PPDP
2007
Springer
16 years 20 days ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
183
click to vote
VMCAI
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. In this paper we analyze the complexity of checking safety and termination properties, for a very simple, yet non-trivial, class of programs with singly-linked list data ...
160
click to vote
IJCAI
2003
15 years 8 months ago
2003
Increasing dialogue efficiency in case-based reasoning (CBR) must be balanced against the risk of commitment to a sub-optimal solution. Focusing on incremental query elicitation i...
139
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we investigate the affect of various acceptance conditions on recogniser membrane systems without dissolution. We demonstrate that two particular acceptance conditio...