Sciweavers

3793 search results - page 158 / 759
» Expressive Description Logics
Sort
View
169
Voted
ER
2007
Springer
108views Database» more  ER 2007»
16 years 1 months ago
Reasoning over Extended ER Models
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...
150
Voted
IAT
2008
IEEE
16 years 1 months ago
Extending a Defeasible Reasoner with Modal and Deontic Logic Operators
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...
ENTCS
2008
104views more  ENTCS 2008»
15 years 7 months ago
A Logic for Virtual Memory
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 ...
Rafal Kolanski
ICDE
2007
IEEE
97views Database» more  ICDE 2007»
16 years 1 months ago
Service Description and Analysis From a Type Theoretic Approach
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...
Ken Q. Pu
CADE
2006
Springer
15 years 10 months ago
Presburger Modal Logic Is PSPACE-Complete
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...
Stéphane Demri, Denis Lugiez