An incomplete degree is cuppable if it can be joined by an incomplete degree to a complete degree. For sets fulfilling some type of simplicity property one can now ask whether these sets are cuppable with respect to a certain type of reducibilities. Several such results are known. In this paper we settle all the remaining cases for the standard notions of simplicity and all the main strong redu...

This paper describes a representation of the dynamics of human walking action for the purpose of person identification and classification by gait appearance. Our gait representation is based on simple features such as moments extracted from video silhouettes of human walking motion. We claim that our gait dynamics representation is rich enough for the task of recognition and classification. The...

We present a new strategy for semantic paramodulation for Horn sets and prove its completeness The strategy requires for each paramoduiation that either both parents be false positive units or that one parent and the paramodulant both be false relative to an interpretation We also discuss some of the issues involved in choosing an interpretation that has a chance of giving better performance th...

Let R be a relation on the domain of a computable structure A. We establish that the existence of an isomorphic copy B ofA such that the image of R (¬R, resp.) is h-simple (h-immune, resp.) relative to B is equivalent to a syntactic condition, termed R is formally h-simple (formally h-immune, resp.) on A.