5506 search results - page 121 / 1102 » Minimal Logic Programs |
140
click to vote
MSS
2008
IEEE
15 years 3 months ago
2008
IEEE
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm draws upon a linear programming formulation of a subset...
141
Voted
IJCAI
2001
15 years 4 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...
123
click to vote
PLPV
2010
ACM
16 years 5 days 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...
132
click to vote
FOSSACS
2001
Springer
15 years 7 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...
110
click to vote
WLP
2005
Springer
15 years 8 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...