Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programm...
In recent years Arvind's Group at MIT has shown the usefulness of term rewriting theory for the specification of processor architectures. In their approach processors specifi...
Abstract. This paper presents verified quantifier elimination procedures for dense linear orders (DLO), for real and for integer linear arithmetic. The DLO procedures are new. All ...
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while ...
Proposals for logic-based argumentation have the potential to be adapted for handling diverse kinds of knowledge. In this paper, a calculus for representing temporal knowledge is p...