Sciweavers

535 search results - page 11 / 107
» Termination of Abstract Reduction Systems
Sort
View
RTA
2005
Springer
14 years 3 months ago
Orderings for Innermost Termination
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...
Mirtha-Lina Fernández, Guillem Godoy, Alber...
LOGCOM
2007
97views more  LOGCOM 2007»
13 years 9 months ago
Termination for Hybrid Tableaus
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...
Thomas Bolander, Patrick Blackburn
ICLP
1997
Springer
14 years 1 months ago
Automatic Termination Analysis of Logic Programs
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...
Naomi Lindenstrauss, Yehoshua Sagiv
DEXA
2009
Springer
70views Database» more  DEXA 2009»
14 years 4 months ago
On the Termination Problem for Declarative XML Message Processing
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....
Tadeusz Litak, Sven Helmer
ENTCS
2002
66views more  ENTCS 2002»
13 years 9 months ago
Strongly Normalising Cut-Elimination with Strict Intersection Types
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 ...
Steffen van Bakel