We investigate here concept learning from incomplete examples. Our first purpose is to discuss to what extent logical learning settings have to be modified in order to cope with da...
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimul...
The method of logical relations assigns a relational interpretation to types that expresses operational invariants satisfied by all terms of a type. The method is widely used in ...
A single logical entity can be referred to by several different names over a large text corpus. We present our algorithm for finding all suchco-reference sets in a large corpus. Ou...
SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent deve...
Christoph Weidenbach, Dilyana Dimova, Arnaud Fietz...