3481 search results - page 189 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
Traditional object-oriented programming languages can be difficult to use when working with ontologies, leading to the creation of domain-specific languages designed specifically...
78
Voted
EUROCOLT
1999
Springer
15 years 2 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 ...
IAT
2006
IEEE
15 years 4 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...
86
Voted
JELIA
2004
Springer
15 years 3 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....
ICLP
2007
Springer
15 years 2 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...