Sciweavers

153 search results - page 27 / 31
» Deciding expressive description logics in the framework of r...
Sort
View
LICS
2009
IEEE
14 years 5 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
SEMWEB
2005
Springer
14 years 4 months ago
On the Properties of Metamodeling in OWL
A common practice in conceptual modeling is to separate the conceptual from the data model. Although very intuitive, this approach is inadequate for many complex domains, in which...
Boris Motik
ICDT
2012
ACM
251views Database» more  ICDT 2012»
12 years 1 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
ICFEM
2009
Springer
13 years 8 months ago
Graded-CTL: Satisfiability and Symbolic Model Checking
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
Alessandro Ferrante, Margherita Napoli, Mimmo Pare...
TOSEM
2010
168views more  TOSEM 2010»
13 years 5 months ago
Analysis and applications of timed service protocols
Web services are increasingly gaining acceptance as a framework for facilitating application-to-application interactions within and across enterprises. It is commonly accepted tha...
Julien Ponge, Boualem Benatallah, Fabio Casati, Fa...