32 search results - page 1 / 7 » Taming the Complexity of Inductive Logic Programming |
SOFSEM
2010
Springer
14 years 2 months ago
2010
Springer
CORR
2002
Springer
13 years 5 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...
DLOG
2008
13 years 8 months ago
2008
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
IUI
1999
ACM
13 years 10 months ago
1999
ACM
Although Programming by Demonstration (PBD) has the potential to improve the productivity of unsophisticated users, previous PBD systems have used brittle, heuristic, domain-speci...
CONCUR
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...