Sciweavers

16 search results - page 1 / 4
» Checking Full Satisfiability of Conceptual Models
Sort
View
DLOG
2010
13 years 5 months ago
Checking Full Satisfiability of Conceptual Models
Abstract. UML class diagrams (UCDs) are the de-facto standard formalism for the analysis and design of information systems. By adopting formal language techniques to capture constr...
Alessandro Artale, Diego Calvanese, Yazmin Ang&eac...
SEBD
2001
145views Database» more  SEBD 2001»
13 years 8 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
EDBTW
2006
Springer
13 years 11 months ago
Unsatisfiability Reasoning in ORM Conceptual Schemes
ORM (Object-Role Modeling) is a rich and well-known conceptual modeling method. As ORM has a formal semantics, reasoning tasks such as satisfiability checking of an ORM schema natu...
Mustafa Jarrar, Stijn Heymans
ATAL
2006
Springer
13 years 11 months ago
On the complexity of practical ATL model checking
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
Wiebe van der Hoek, Alessio Lomuscio, Michael Wool...
SIGSOFT
2007
ACM
14 years 8 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...