1350 search results - page 159 / 270 » Reasoning about Staged Computation |
CADE
2002
Springer
15 years 10 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
136
click to vote
SIGMOD
2009
ACM
15 years 10 months ago
2009
ACM
In this paper we present a method for reasoning about privacy using the concepts of exchangeability and deFinetti's theorem. We illustrate the usefulness of this technique by...
SDM
2009
SIAM
15 years 7 months ago
2009
SIAM
Recently, many advanced machine learning approaches have been proposed for coreference resolution; however, all of the discriminatively-trained models reason over mentions rather ...
TPHOL
2008
IEEE
15 years 4 months ago
2008
IEEE
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
tion and Abstract Separation Logic Cristiano Calcagno Imperial College, London Peter W. O’Hearn Queen Mary, University of London Hongseok Yang Queen Mary, University of London S...