977 search results - page 101 / 196 » Logic programming with infinite sets |
125
click to vote
ILP
2007
Springer
15 years 6 months ago
2007
Springer
In this chapter, we describe a view of statistical learning in the inductive logic programming setting based on kernel methods. The relational representation of data and background...
123
click to vote
ICTAI
2007
IEEE
15 years 7 months ago
2007
IEEE
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
99
Voted
ICLP
2004
Springer
15 years 6 months ago
2004
Springer
The extended answer set semantics for logic programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these semantics based on a preference rel...
117
click to vote
ICFP
2003
ACM
16 years 16 days ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
114
click to vote
POPL
2012
ACM
13 years 8 months ago
2012
ACM
We present a general theory of Gifford-style type and effect annotations, where effect annotations are sets of effects. Generality is achieved by recourse to the theory of algebra...