367 search results - page 37 / 74 » A Rewriting Logic Sampler |
96
Voted
GG
2004
Springer
15 years 5 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
140
click to vote
ALP
1997
Springer
15 years 4 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
103
Voted
CADE
1990
Springer
15 years 4 months ago
1990
Springer
We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, kn...
111
Voted
LOPSTR
2007
Springer
15 years 6 months ago
2007
Springer
This paper introduces a modular framework for termination analysis of logic programming. To this end, we adapt the notions of dependency pairs and dependency graphs (which were dev...
109
Voted
TLCA
1999
Springer
15 years 4 months ago
1999
Springer
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...