525 search results - page 31 / 105 » Composing Programs in a Rewriting Logic for Declarative Prog... |
138
click to vote
LOPSTR
2009
Springer
15 years 10 months 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...
107
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...
136
Voted
CLEF
2005
Springer
15 years 9 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...
146
click to vote
ENTCS
2007
15 years 3 months ago
2007
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
141
click to vote
ICLP
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination...