Sciweavers

1054 search results - page 123 / 211
» A Logic Language of Granular Computing
Sort
View
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 10 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
ICFP
2003
ACM
14 years 7 months ago
An extension of HM(X) with bounded existential and universal data-types
We propose a conservative extension of HM(X), a generic constraint-based type inference framework, with bounded existential (a.k.a. abstract) and universal (a.k.a. polymorphic) da...
Vincent Simonet
WSPI
2004
13 years 9 months ago
A Formal Theory of Conceptual Modeling Universals
Conceptual Modeling is a discipline of great relevance to several areas in Computer Science. In a series of papers [1,2,3] we have been using the General Ontological Language (GOL)...
Giancarlo Guizzardi, Gerd Wagner, Marten van Sinde...
SAC
2006
ACM
14 years 1 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
Sylvie Boldo, César Muñoz
CORR
2007
Springer
64views Education» more  CORR 2007»
13 years 7 months ago
Generating models for temporal representations
We discuss the use of model building for temporal representations. We chose Polish to illustrate our discussion because it has an interesting aspectual system, but the points we w...
Patrick Blackburn, Sébastien Hinderer