Sciweavers

351 search results - page 7 / 71
» Nominal Equational Logic
Sort
View
PPDP
2004
Springer
14 years 26 days ago
Nominal rewriting systems
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...
Maribel Fernández, Murdoch Gabbay, Ian Mack...
ESOP
2011
Springer
12 years 11 months ago
General Bindings and Alpha-Equivalence in Nominal Isabelle
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...
Christian Urban, Cezary Kaliszyk
WWW
2011
ACM
13 years 2 months ago
A better uncle for OWL: nominal schemas for integrating rules and ontologies
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...
Markus Krötzsch, Frederick Maier, Adila Krisn...
POPL
2010
ACM
14 years 4 months ago
Nominal System T
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...
Andrew M. Pitts
ENTCS
2011
125views more  ENTCS 2011»
12 years 11 months ago
A Hybrid Public Announcement Logic with Distributed Knowledge
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...
Jens Ulrik Hansen