764 search results - page 47 / 153 » On the Expressibility of Stable Logic Programming |
FOSSACS
2001
Springer
14 years 19 days ago
2001
Springer
Garbage collection relieves the programmer of the burden of managing dynamically allocated memory, by providing an automatic way to reclaim unneeded storage. This eliminates or les...
PPDP
2009
Springer
14 years 2 months ago
2009
Springer
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...
LPNMR
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and pract...
CP
1998
Springer
14 years 11 days ago
1998
Springer
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Similarity-based Logic Programming (briefly, SLP) has been proposed to enhance the LP paradigm with a kind of approximate reasoning which supports flexible information retrieval a...