Sciweavers

7289 search results - page 98 / 1458
» A Dependent Set Theory
Sort
View
EUROPAR
2005
Springer
14 years 1 months ago
Replication Predicates for Dependent-Failure Algorithms
Abstract. To establish lower bounds on the amount of replication, there is a common partition argument used to construct indistinguishable executions such that one violates some pr...
Flavio Paiva Junqueira, Keith Marzullo
PLPV
2009
ACM
14 years 4 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
AI
2007
Springer
13 years 8 months ago
Axiomatic characterization of the AGM theory of belief revision in a temporal logic
Since belief revision deals with the interaction of belief and information over time, branching-time temporal logic seems a natural setting for a theory of belief change. We propo...
Giacomo Bonanno
JMLR
2010
99views more  JMLR 2010»
13 years 2 months ago
An Efficient Explanation of Individual Classifications using Game Theory
We present a general method for explaining individual predictions of classification models. The method is based on fundamental concepts from coalitional game theory and prediction...
Erik Strumbelj, Igor Kononenko
SIGMOD
2009
ACM
140views Database» more  SIGMOD 2009»
14 years 8 months ago
Estimating the confidence of conditional functional dependencies
Conditional functional dependencies (CFDs) have recently been proposed as extensions of classical functional dependencies that apply to a certain subset of the relation, as specif...
Graham Cormode, Lukasz Golab, Flip Korn, Andrew Mc...