165 search results - page 1 / 33 » Estimating the Computational Cost of Logic Programs |
SAS
1994
Springer
13 years 9 months ago
1994
Springer
CORR
2002
Springer
13 years 4 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...
ILP
2003
Springer
13 years 10 months ago
2003
Springer
Query optimization is used frequently in relational database management systems. Most existing techniques are based on reordering the relational operators, where the most selective...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
LOPSTR
2004
Springer
13 years 10 months ago
2004
Springer
We propose an analysis for detecting procedures and goals that are deterministic (i.e. that produce at most one solution), or predicates whose clause tests are mutually exclusive (...