2432 search results - page 248 / 487 » Cryptographic logical relations |
186
click to vote
ILP
2003
Springer
15 years 11 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...
151
click to vote
APAL
2010
15 years 6 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...
202
click to vote
FOIKS
2006
Springer
15 years 10 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
187
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
158
click to vote
FOIS
2006
15 years 8 months ago
2006
We present a theory of granular parthood based on qualitative cardinality and size measures. Using standard mereological relations and qualitative, contextdependent relations such ...