A lot of methods have been proposed -- and sometimes implemented -- for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of ...
Peter Balsiger, Alain Heuerding, Stefan Schwendima...
In this paper we introduce the logic programminglanguage Disjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive C...
In this paper we present an alternative order-theoretic proof of the Banach fixed point theorem for selfmaps on complete metric spaces which is based on formal balls and, contrary...
We present an efficient encoding of core Java constructs in a simple, implementable typed intermediate language. The encoding, after type erasure, has the same operational behavio...
We give two generic proofs for cut elimination in propositional modal logics, interpreted over coalgebras. We first investigate semantic coherence conditions between the axiomati...