Results 1  10
of
2,117
Provenance semirings
 PODS'07
, 2007
"... We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms involving semirings. This further suggests a comprehensive provenance representation that uses semirings of polynomials. ..."
Abstract

Cited by 197 (30 self)
 Add to MetaCart
We show that relational algebra calculations for incomplete databases, probabilistic databases, bag semantics and whyprovenance are particular cases of the same general algorithms involving semirings. This further suggests a comprehensive provenance representation that uses semirings of polynomials
Making Linked Open Data Writable with Provenance Semirings
"... Abstract. Linked Open Data cloud (LOD) is essentially readonly, restraining the possibility of collaborative knowledge construction. To support collaboration, we need to make the LOD writable. In this paper, we propose a vision for a writable linked data where each LOD participant can define upda ..."
Abstract
 Add to MetaCart
updatable materialized views from data hosted by other participants. Consequently, building a writable LOD can be reduced to the problem of SPARQL selfmaintenance of SelectUnion recursive materialized views. We propose TMGraph, an RDFGraph annotated with elements of a specialized provenance semiring
Graphical models, exponential families, and variational inference
, 2008
"... The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fiel ..."
Abstract

Cited by 800 (26 self)
 Add to MetaCart
The formalism of probabilistic graphical models provides a unifying framework for capturing complex dependencies among random variables, and building largescale multivariate statistical models. Graphical models have become a focus of research in many statistical, computational and mathematical fields, including bioinformatics, communication theory, statistical physics, combinatorial optimization, signal and image processing, information retrieval and statistical machine learning. Many problems that arise in specific instances — including the key problems of computing marginals and modes of probability distributions — are best studied in the general setting. Working with exponential family representations, and exploiting the conjugate duality between the cumulant function and the entropy for exponential families, we develop general variational representations of the problems of computing likelihoods, marginal probabilities and most probable configurations. We describe how a wide varietyof algorithms — among them sumproduct, cluster variational methods, expectationpropagation, mean field methods, maxproduct and linear programming relaxation, as well as conic programming relaxations — can all be understood in terms of exact or approximate forms of these variational representations. The variational approach provides a complementary alternative to Markov chain Monte Carlo as a general source of approximation methods for inference in largescale statistical models.
SemiringAnnotated Data: Queries and Provenance
, 2012
"... We present an overview of the literature on querying semiringannotated data, a notion we introduced five years ago in a paper with Val Tannen. First, we show that positive relational algebra calculations for various forms of annotated relations, as well as provenance models for such queries, are pa ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
We present an overview of the literature on querying semiringannotated data, a notion we introduced five years ago in a paper with Val Tannen. First, we show that positive relational algebra calculations for various forms of annotated relations, as well as provenance models for such queries
Orderings on semirings
"... Though more general definitions are sometimes used, for this paper a semiring will be defined to be a set S with two operations + (addition) and 9 (multiplication); with respect to addition, S is a commutative monoid with 0 as its identity dement 9 With respect to multiplication, S is a (generaily n ..."
Abstract
 Add to MetaCart
of semirings. Semirings have proven to be useful in theoretical computer science, in particular for studying automata nd formal languages. Several authors have considered total order relations on semirings (e.g. [8, 9]). In this paper, we begin by looking at special classes of semirings which arise naturally
On the Limitations of Provenance for Queries With Difference
"... The annotation of the results of database transformations was shown to be very effective for various applications. Until recently, most works in this context focused on positive query languages. The provenance semirings is a particular approach that was proven effective for these languages, and it w ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
The annotation of the results of database transformations was shown to be very effective for various applications. Until recently, most works in this context focused on positive query languages. The provenance semirings is a particular approach that was proven effective for these languages
Compiling Semiringbased Constraints with ...
 In M.Maher and JF. Puget, editors, Proc. CP98. SpringerVerlag, LNCS 1520
, 1998
"... . In some recent works, a general framework for finite domains constraint satisfaction has been defined, where classical CSPs, fuzzy CSPs, weighted CSPs, partial CSPs and others can be easily cast. This framework, based on a semiring structure, allows, under certain conditions, to compute arcconsis ..."
Abstract

Cited by 41 (8 self)
 Add to MetaCart
. In some recent works, a general framework for finite domains constraint satisfaction has been defined, where classical CSPs, fuzzy CSPs, weighted CSPs, partial CSPs and others can be easily cast. This framework, based on a semiring structure, allows, under certain conditions, to compute arc
Valued constraint satisfaction problems: Hard and easy problems
 IJCAI’95: Proceedings International Joint Conference on Artificial Intelligence
, 1995
"... tschiexOtoulouse.inra.fr fargierOirit.fr verfailOcert.fr In order to deal with overconstrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathema ..."
Abstract

Cited by 328 (41 self)
 Add to MetaCart
tschiexOtoulouse.inra.fr fargierOirit.fr verfailOcert.fr In order to deal with overconstrained Constraint Satisfaction Problems, various extensions of the CSP framework have been considered by taking into account costs, uncertainties, preferences, priorities...Each extension uses a specific mathematical operator (+, max...) to aggregate constraint violations. In this paper, we consider a simple algebraic framework, related to Partial Constraint Satisfaction, which subsumes most of these proposals and use it to characterize existing proposals in terms of rationality and computational complexity. We exhibit simple relationships between these proposals, try to
Circuits for Datalog Provenance
"... The annotation of the results of database queries with provenance information has many applications. This paper studies provenance for datalog queries. We start by considering provenance representation by (positive) Boolean expressions, as pioneered in the theories of incomplete and probabilist ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
such as query evaluation in probabilistic databases, and in deletion propagation. Next, we study the possibility of extending the circuit approach to the more general framework of semiring annotations introduced in earlier work. We show that for a large and useful class of provenance semirings, we can
Results 1  10
of
2,117