95 search results - page 10 / 19 » Reasoning with OWL-DL in Inductive Logic Programming |
105
Voted
TPHOL
2005
IEEE
15 years 5 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
196
Voted
POPL
2006
ACM
15 years 12 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
192
click to vote
POPL
2008
ACM
15 years 12 months ago
2008
ACM
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
101
Voted
ILP
2003
Springer
15 years 4 months ago
2003
Springer
The learning system Progol5 and the underlying inference method of Bottom Generalisation are firmly established within Inductive Logic Programming (ILP). But despite their success...
110
click to vote
ENTCS
2002
14 years 11 months ago
2002
Abstract The last edition of CLIMA, held in 2001 in Paphos (Cyprus) ended with a panel session on the role of Computational Logic (CL) in Multi-Agent Systems (MAS). Two dimensions ...