Equational logic is one of the most important domains of research in computer science. Specifications of types of data structures and assertions about the behaviour of programs are naturally written in equational form. Programs made of equations are called equational programs and appear in functional programming, logic programming and in most combinations of high level programming paradigms [19...

We address the problem of answering conjunctive queries over knowledge bases, specified by sets of first-order sentences called tuple-generating dependencies (TGDs). This problem is highly relevant to query optimization, information integration, and ontological reasoning. We present a rewriting algorithm, inspired by resolution in Logic Programming, which is capable of dealing with an expressiv...

Deductive object bases attempt to combine the advantages of deductive relational databases with those of object-oriented models. We review modeling and optimization issues encountered during the development of ConceptBase, a prototype deductive object base supporting the Telos data model. We also report on a number of application experiences in the eld of meta data management. This work was sup...

Sliding effects often occur along tissue/organ boundaries. However, most conventional registration techniques either use smooth parametric bases or apply homogeneous smoothness regularization, and fail to address the sliding issue. In this study, we propose a class of discontinuity-preserving regularizers that fit naturally into optimization-based registration. The proposed regularization encou...

In knowledge representation by fuzzy rule based systems two reasoning mechanisms can be distinguished: conjunction-based and implication-based inference. Both approaches have complementary advantages and drawbacks depending on the structure of the knowledge that should be represented. Implicative rule bases are less sensitive to incompleteness of knowledge. However, implication-based inference ...

Sparse coding, a method of explaining sensory data with as few dictionary bases as possible, has attracted much attention in computer vision. For visual object category recognition, `1 regularized sparse coding is combined with the spatial pyramid representation to obtain state-of-the-art performance. However, because of its iterative optimization, applying sparse coding onto every local featur...

Abstract. Intrusion Detection Systems (IDS) have proven as valuable measure to cope reactively with attacks in the Internet. The growing complexity of ITsystems, however, increases rapidly the audit data volumes and the size of the signature bases. This forces IDS to drop audit data in high load situations thus offering attackers chances to act undetected. To tackle this issue we propose an eff...