3513 search results - page 118 / 703 » Super Logic Programs |
73
Voted
CORR
2002
Springer
14 years 10 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
79
Voted
ICLP
2004
Springer
15 years 3 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...
87
Voted
ATS
2009
IEEE
15 years 3 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...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. In human-like reasoning it often happens that different conditions, partially alternative and hierarchically structured, are mentally grouped in order to derive some conc...
108
click to vote
AI
2001
Springer
15 years 1 months ago
2001
Springer
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are no...