2138 search results - page 210 / 428 » Logics for the Relational Syllogistic |
APAL
2010
13 years 8 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...
FOIKS
2006
Springer
14 years 7 hour 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...
CSL
2010
Springer
13 years 9 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...
FOIS
2006
13 years 9 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 ...
IDA
2008
Springer
13 years 8 months ago
2008
Springer
Currently statistical and artificial neural network methods dominate in data mining applications. Alternative relational (symbolic) data mining methods have shown their effectivene...