3470 search results - page 266 / 694 » Head-Elementary-Set-Free Logic Programs |
172
click to vote
ICLP
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
169
click to vote
ATS
2009
IEEE
15 years 11 months ago
2009
IEEE
Caches are crucial components in modern processors (both stand-alone or integrated into SoCs) and their test is a challenging task, especially when addressing complex and high-fre...
170
click to vote
ICLP
2001
Springer
15 years 11 months ago
2001
Springer
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
181
click to vote
ESOP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
178
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
Tabling or memoing is a technique where one stores intermediate answers to a problem so that they can be reused in further calls. Tabling is of interest to logic programming becau...