60 search results - page 3 / 12 » No complete linear term rewriting system for propositional l... |
FLOPS
2008
Springer
13 years 9 months ago
2008
Springer
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...
CADE
2012
Springer
11 years 9 months 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...
RTA
1995
Springer
13 years 11 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simplifications. Computational systems are rewrite theories enriched by stra...
LOGCOM
1998
13 years 7 months ago
1998
Sound and complete modal propositional logic C is presented, in which 2P has the interpretation “ P is true in all states”. The interpretation is already known as the Carnapia...
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
We introduce novel, sound, complete, and locally optimal evaluation strategies for functional logic programming languages. Our strategies combine, in a non-trivial way, two landma...