We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heap...
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
nition of a common model that abstracted the shared knowledge (ontology); a formalism for representing such knowledge (Knowledge Interchange Format, or KIF); and a transport-indepe...
: Metadata research has emerged as a new discipline in the last years, and is focused on the provision of semantic descriptions of a diverse kind to digital resources, web resource...
This paper presents our work on supporting evaluation of integrity constraint issues in semantic web instance data. We propose an alternative semantics for the ontology language, i...