Sciweavers

2062 search results - page 66 / 413
» Derivatives of Logical Formulas
Sort
View
PODS
2008
ACM
141views Database» more  PODS 2008»
15 years 11 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob
ASE
2008
135views more  ASE 2008»
14 years 11 months ago
Deriving event-based transition systems from goal-oriented requirements models
Goal-oriented methods are increasingly popular for elaborating software requirements. They offer systematic support for incrementally building intentional, structural, and operati...
Emmanuel Letier, Jeff Kramer, Jeff Magee, Sebasti&...
CONCUR
2005
Springer
15 years 4 months ago
Deriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition syst...
Roberto Bruni, Fabio Gadducci, Ugo Montanari, Pawe...
SEBD
2001
145views Database» more  SEBD 2001»
15 years 12 days 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...
LOGCOM
2007
115views more  LOGCOM 2007»
14 years 11 months ago
The Dynamics of Syntactic Knowledge
The syntactic approach to epistemic logic avoids the logical omniscience problem by taking knowledge as primary rather than as defined in terms of possible worlds. In this study, ...
Thomas Ågotnes, Natasha Alechina