507 search results - page 49 / 102 » Automating first-order relational logic |
127
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...
97
Voted
LICS
2002
IEEE
15 years 5 months ago
2002
IEEE
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
96
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
We present a type theory with some proof-irrelevance built into the conversion rule. We argue that this feature is useful when type theory is used as the logical formalism underlyi...
111
click to vote
IJCAI
1993
15 years 2 months ago
1993
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
99
Voted
TARK
2005
Springer
15 years 6 months ago
2005
Springer
: Two difficult issues for the logic of knowledge have been logical omniscience and common knowledge. Our existing logics of knowledge based on Kripke structures seem to justify lo...