7456 search results - page 195 / 1492 » Parallelism in Logic Programs |
182
click to vote
IJCAI
2001
15 years 7 months ago
2001
We are interested in semantical underpinnings for existing approaches to preference handling in extended logic programming (within the framework of answer set programming). As a s...
163
click to vote
PLPV
2010
ACM
16 years 3 months ago
2010
ACM
Type-based reasoning is popular in functional programming. In particular, parametric polymorphism constrains functions in such a way that statements about their behavior can be de...
178
click to vote
FOSSACS
2001
Springer
15 years 11 months 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...
171
click to vote
GRID
2004
Springer
15 years 12 months ago
2004
Springer
Allowing loose coupling between complex e-Science applications has many advantages, such as being able to easily incorporate new applications and to flexibly specify how the appl...
148
click to vote
WLP
2005
Springer
15 years 12 months ago
2005
Springer
Assigning semantics to logic programs via selector generated models (Schwarz 2002/2003) extends several semantics, like the stable, the inflationary, and the stable generated sema...