122 search results - page 19 / 25 » Abductive Logic Programming by Nonground Rewrite Systems |
148
click to vote
PPDP
1999
Springer
15 years 6 months ago
1999
Springer
hemical abstract machine Shinya Sato Himeji Dokkyo University, Faculty of Econoinformatics, 7-2-1 Kamiohno, Himeji-shi, Hyogo 670-8524, Japan Ian Mackie LIX, CNRS UMR 7161, ´Ecole...
109
click to vote
AMAST
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
149
click to vote
PEPM
2010
ACM
15 years 3 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
126
click to vote
PPDP
2007
Springer
15 years 8 months 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...
ICLP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...