We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
Abstract. Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi in...
We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like“variable nominal classes”within axioms. This feature allows ontology langua...
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...
In this paper the machinery of Hybrid Logic and the logic of public announcements are merged. In order to bring the two logics together properly the underlying hybrid logic has be...