95 search results - page 17 / 19 » Reasoning with OWL-DL in Inductive Logic Programming |
ILP
2007
Springer
13 years 11 months ago
2007
Springer
A recurrent question in the design of intelligent agents is how to assign degrees of beliefs, or subjective probabilities, to various events in a relational environment. In the sta...
FLOPS
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
ILP
2007
Springer
13 years 11 months ago
2007
Springer
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). W...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...