584 search results - page 20 / 117 » Logic Programs as term Rewriting Systems |
CADE
2012
Springer
13 years 23 hour ago
2012
Springer
Abstract. This paper presents new results on the decidability of inductive validity of conjectures. For these results, a class of term rewrite systems (TRSs) with built-in linear i...
80
Voted
CADE
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
MFCS
1997
Springer
15 years 1 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
SIGMOD
2001
ACM
15 years 9 months ago
2001
ACM
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
74
Voted
PADL
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Programming with rewrite rules and strategies has been already used for describing several computational logics. This paper describes the way the Needham-Schroeder Public...