Sciweavers

860 search results - page 166 / 172
» Completeness in two-party secure computation: a computationa...
Sort
View
SAT
2005
Springer
129views Hardware» more  SAT 2005»
15 years 3 months ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah
FOSSACS
2003
Springer
15 years 3 months ago
A Game Semantics for Generic Polymorphism
Genericity is the idea that the same program can work at many different data types. Longo, Milstead and Soloviev proposed to capture the inability of generic programs to probe th...
Samson Abramsky, Radha Jagadeesan
DBPL
1993
Springer
89views Database» more  DBPL 1993»
15 years 1 months ago
Database Programming in Transaction Logic
This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion f...
Anthony J. Bonner, Michael Kifer, Mariano P. Conse...
FPCA
1989
15 years 1 months ago
A Simple Semantics for ML Polymorphism
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
Atsushi Ohori
DASFAA
2006
IEEE
153views Database» more  DASFAA 2006»
15 years 1 months ago
Dissemination of Dynamic Data: Semantics, Algorithms, and Performance
Abstract The Internet and the Web are increasingly used to disseminate fast changing data such as sensor data, traffic and weather information, stock prices, sports scores, and eve...
Krithi Ramamritham