1385 search results - page 90 / 277 » Natural Rewriting for General Term Rewriting Systems |
132
click to vote
BIRTHDAY
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Variables make rule-based systems more abstract and expressive, as witnessed by term rewriting systems and two-level grammars. In this paper we show that variables can be...
167
click to vote
CLEF
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper the methodology followed to build a questionanswering system for the Portuguese language is described. The system modules are built using computational ling...
133
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
— Since Witsenhausen put forward his remarkable counterexample in 1968, there have been many attempts to develop efficient methods for solving this non-convex functional optimiz...
198
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Contemporary use of the term ’intension’ derives from the traditional logical doctrine that an idea has both an extension and an intension. In this paper we introduce an intens...
178
click to vote
LOPSTR
2009
Springer
16 years 22 days ago
2009
Springer
We show how to combine the two most powerful approaches for automated termination analysis of logic programs (LPs): the direct approach which operates directly on LPs and the trans...