Sciweavers

111 search results - page 3 / 23
» The eskolemization of universal quantifiers
Sort
View
SAS
2009
Springer
119views Formal Methods» more  SAS 2009»
14 years 6 months ago
Abstraction Refinement for Quantified Array Assertions
ion Refinement for Quantified Array Assertions Mohamed Nassim Seghir1, , Andreas Podelski1 , and Thomas Wies1,2 1 University of Freiburg, Germany 2 EPFL, Switzerland Abstract. We p...
Mohamed Nassim Seghir, Andreas Podelski, Thomas Wi...
JCDL
2006
ACM
75views Education» more  JCDL 2006»
14 years 4 hour ago
Quantifying the accuracy of relational statements in Wikipedia: a methodology
The Perseus Project at Tufts University produces tools to enhance the study of humanities texts. Perseus’ new named-entity browser lets users browse an index of references to pe...
Gabriel Weaver, Barbara Strickland, Gregory Crane
SIGMOD
2006
ACM
128views Database» more  SIGMOD 2006»
14 years 6 months ago
Temporal aggregates and temporal universal quantification in standard SQL
Although it has been acknowledged for many years that querying and updating time-varying information using standard (i.e., non-temporal) SQL is a challenging task, the proposed te...
Esteban Zimányi
ATAL
2010
Springer
13 years 7 months ago
A quantified distributed constraint optimization problem
In this paper, we propose a Quantified Distributed Constraint Optimization problem (QDCOP) that extends the framework of Distributed Constraint Optimization problems (DCOPs). DCOP...
Toshihiro Matsui, Hiroshi Matsuo, Marius-Calin Sil...
ACNS
2006
Springer
138views Cryptology» more  ACNS 2006»
13 years 9 months ago
Syntax-Driven Private Evaluation of Quantified Membership Queries
Abstract. Membership queries are basic predicate operations that apply to datasets. Quantifications of such queries express global properties between datasets, including subset inc...
Aggelos Kiayias, Antonina Mitrofanova