3513 search results - page 145 / 703 » Super Logic Programs |
118
click to vote
EUROCOLT
1999
Springer
15 years 7 months ago
1999
Springer
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
127
click to vote
LPNMR
2004
Springer
15 years 8 months ago
2004
Springer
We investigate a generalization of weight-constraint programs with stable semantics, as implemented in the ASP solver smodels. Our programs admit atoms of the form X, F where X is ...
136
click to vote
IAT
2006
IEEE
15 years 9 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...
110
click to vote
SAS
2005
Springer
15 years 8 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...
133
click to vote
JELIA
2004
Springer
15 years 8 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....