3546 search results - page 132 / 710 » A Causal Logic of Logic Programming |
140
click to vote
ICLP
1999
Springer
15 years 8 months ago
1999
Springer
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
130
click to vote
ICLP
2004
Springer
15 years 9 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...
137
click to vote
ATS
2009
IEEE
15 years 9 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...
112
click to vote
SUM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are intere...
152
click to vote
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...