3738 search results - page 101 / 748 » Parametrized Logic Programming |
175
Voted
FSTTCS
2007
Springer
16 years 1 months ago
2007
Springer
There are two somewhat contradictory ways of looking at modules in a given programming language. On the one hand, module systems are largely independent of the particulars of progr...
246
Voted
ICLP
2003
Springer
16 years 19 days ago
2003
Springer
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered, which holds if the programs P ∪ R and Q ∪ R h...
173
click to vote
LPNMR
2004
Springer
16 years 23 days ago
2004
Springer
Abstract. We consider the simplification of logic programs under the stablemodel semantics, with respect to the notions of strong and uniform equivalence between logic programs, r...
190
click to vote
PPDP
2001
Springer
15 years 12 months ago
2001
Springer
This paper describes an implementation of narrowing, an essential component of implementations of modern functional logic languages. These implementations rely on narrowing, in pa...