In this paper we study the intermediate logic MLO(X) of open subsets of a metric space X. This logic is closely related to Medvedev's logic of finite problems ML. We prove sev...
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
We address the problem of reasoning with instances of heterogeneously formalized ontologies. Given a set of semantic mappings, reconciling conceptual and instance level heterogenei...
In the most popular logics combining knowledge and awareness, it is not possible to express statements about knowledge of unawareness such as “Ann knows that Bill is aware of so...
First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, ...