Sciweavers

1455 search results - page 226 / 291
» Programming in Logic with Constraints for Natural Language P...
Sort
View
ICFP
2010
ACM
14 years 10 months ago
Distance makes the types grow stronger: a calculus for differential privacy
We want assurances that sensitive information will not be disclosed when aggregate data derived from a database is published. Differential privacy offers a strong statistical guar...
Jason Reed, Benjamin C. Pierce
ICFP
2009
ACM
15 years 10 months ago
Identifying query incompatibilities with evolving XML schemas
During the life cycle of an XML application, both schemas and queries may change from one version to another. Schema evolutions may affect query results and potentially the validi...
Nabil Layaïda, Pierre Genevès, Vincent...
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
15 years 3 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
CORR
2010
Springer
101views Education» more  CORR 2010»
14 years 9 months ago
Computing the Least Fixed Point of Positive Polynomial Systems
We consider equation systems of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where f1, . . . , fn are polynomials with positive real coefficients. In vector fo...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
ICALP
2010
Springer
14 years 11 months ago
Parameterized Modal Satisfiability
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...
Antonis Achilleos, Michael Lampis, Valia Mitsou