740 search results - page 50 / 148 » Open Answer Set Programming with Guarded Programs |
ILP
2005
Springer
14 years 2 months ago
2005
Springer
We propose a new approach to Inductive Logic Programming that systematically exploits caching and offers a number of advantages over current systems. It avoids redundant computati...
LPNMR
2009
Springer
14 years 3 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
KRDB
2003
13 years 10 months ago
2003
The Polylog framework is designed to provide a language for efficiently automating complex queries of information represented in multiple formats. A Polylog program contains a set...
JLP
2007
2007
Universality and semicomputability for nondeterministic programming languages over abstract algebras
13 years 9 months ago
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
BIRTHDAY
2010
Springer
13 years 10 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...