3691 search results - page 152 / 739 » Bayesian Logic Programs |
111
Voted
IAT
2006
IEEE
15 years 6 months ago
2006
IEEE
In this paper, we tackle learning in distributed systems and the fact that learning does not necessarily involve the participation of agents directly in the inductive process itse...
92
Voted
SAS
2005
Springer
15 years 6 months ago
2005
Springer
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
108
click to vote
JELIA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The growing size of electronically available text corpora like companies’ intranets or the WWW has made information access a hot topic within computational linguistics....
107
Voted
ICLP
2007
Springer
15 years 4 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
176
Voted
JUCS
2006
15 years 23 days ago
2006
: Several techniques for implementing Prolog in a efficient manner have been devised since the original interpreter, many of them aimed at achieving more speed. There are two main ...