This paper presents a probabilistic relational modelling (implementation) of the major probabilistic retrieval models. Such a high-level implementation is useful since it supports ...
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
Abstract. In this paper, we present a new ontology-based formalism for representing patent information. The framework defines concepts and relations for the major aspects of paten...
Mark Giereth, Steffen Koch, Yiannis Kompatsiaris, ...
l Abstraction via the Frege Quantifier G. Aldo Antonelli Abstract This paper presents a formalization of first-order aritharacterizing the natural numbers as abstracta of the equin...
Fusion is a well-known form of combining normal modal logics endowed with a Hilbert calculi and a Kripke semantics. Herein, fusion is studied over logic systems using sequent calc...