Abstract. We investigate the computational complexity of reasoning over various fragments of the Extended Entity-Relationship (EER) language, which includes a number of constructs:...
Alessandro Artale, Diego Calvanese, Roman Kontchak...
Defeasible logic is a non-monotonic formalism that deals with incomplete and conflicting information. Modal logic deals with necessity and possibility, exhibiting defeasibility; t...
Efstratios Kontopoulos, Nick Bassiliades, Guido Go...
We present an extension to classical separation logic which allows reasoning about virtual memory. Our logic is formalised in the Isabelle/HOL theorem prover in a manner allowing ...
In this paper, we propose to deploy type-theoretic techniques to the service description and composition verification. We define a flexible type system for modeling instances a...
We introduce a Presburger modal logic PML with regularity constraints and full Presburger constraints on the number of children that generalize graded modalities, also known as num...