Sciweavers

1749 search results - page 215 / 350
» Logic, Optimization, and Constraint Programming
Sort
View
POPL
2012
ACM
12 years 3 months ago
The ins and outs of gradual type inference
Gradual typing lets programmers evolve their dynamically typed programs by gradually adding explicit type annotations, which confer benefits like improved performance and fewer r...
Aseem Rastogi, Avik Chaudhuri, Basil Hosmer
WWW
2006
ACM
14 years 8 months ago
A framework for XML data streams history checking and monitoring
The need of formal verification is a problem that involves all the fields in which sensible data are managed. In this context the verification of data streams became a fundamental...
Alessandro Campi, Paola Spoletini
IFIP
2004
Springer
14 years 1 months ago
Decidability of Opacity with Non-Atomic Keys
The most studied property, secrecy, is not always sufficient to prove the security of a protocol. Other properties such as anonymity, privacy or opacity could be useful. Here, we u...
Laurent Mazaré
CASCON
2004
108views Education» more  CASCON 2004»
13 years 9 months ago
Consistent query answering under inclusion dependencies
For several reasons a database may not satisfy certain integrity constraints (ICs), for example, when it is the result of integrating several independent data sources. However, mo...
Loreto Bravo, Leopoldo E. Bertossi
AAAI
1994
13 years 9 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood