Sciweavers

584 search results - page 19 / 117
» Logic Programs as term Rewriting Systems
Sort
View
120
Voted
PPDP
2007
Springer
15 years 6 months ago
Higher-order semantic labelling for inductive datatype systems
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...
Makoto Hamana
IJCAI
2003
15 years 2 months ago
Recycling Computed Answers in Rewrite Systems for Abduction
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanat...
Fangzhen Lin, Jia-Huai You
195
Voted
LISP
2006
160views more  LISP 2006»
15 years 21 days ago
Formal compiler construction in a logical framework
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present a new approach based on the igher-order abstract syntax and ...
Jason Hickey, Aleksey Nogin
94
Voted
PPDP
2007
Springer
15 years 6 months ago
Real-time rewriting semantics of orc
Orc is a language proposed by Jayadev Misra [19] for orchestration of distributed services. Orc is very simple and elegant, based on a few basic constructs, and allows succinct an...
Musab AlTurki, José Meseguer
121
Voted
FLOPS
2008
Springer
15 years 2 months ago
Termination of Narrowing in Left-Linear Constructor Systems
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
Germán Vidal