535 search results - page 11 / 107 » Termination of Abstract Reduction Systems |
137
Voted
RTA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
127
click to vote
LOGCOM
2007
15 years 3 months ago
2007
Abstract. This article extends and improves work on tableau-based decision methods for hybrid logic by Bolander and Bra¨uner [5]. Their paper gives tableau-based decision procedur...
150
Voted
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
Abstract This paper describes a general framework for automatic termination analysis of logic programs, where we understand by termination" the niteness of the LD-tree constru...
113
click to vote
DEXA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We define a formal syntax and semantics for the Rule Definition Language (RDL) of DemaqLite, which is a fragment of the declarative XML message processing system Demaq....
146
Voted
ENTCS
2002
15 years 3 months ago
2002
This paper defines reduction on derivations in the strict intersection type assignment system of [2], by generalising cut-elimination, and shows a strong normalisation result for ...