Sciweavers

2496 search results - page 155 / 500
» On covering by translates of a set
Sort
View
CORR
2010
Springer
93views Education» more  CORR 2010»
15 years 6 months ago
Group-Strategyproof Irresolute Social Choice Functions
We axiomatically characterize the class of pairwise irresolute social choice functions that are group-strategyproof according to Kelly's preference extension. The class is na...
Felix Brandt
BSL
2005
106views more  BSL 2005»
15 years 6 months ago
Compactness and independence in non first order frameworks
This communication deals with positive model theory, a non first order model theoretic setting which preserves compactness at the cost of giving up negation. Positive model theory ...
Itay Ben-Yaacov
AML
2002
62views more  AML 2002»
15 years 6 months ago
Vitali's Theorem and WWKL
Continuing the investigations of X. Yu and others, we study the role of set existence axioms in classical Lebesgue measure theory. We show that pairwise disjoint countable additivi...
Douglas K. Brown, Mariagnese Giusto, Stephen G. Si...
ICDT
1995
ACM
96views Database» more  ICDT 1995»
15 years 10 months ago
On Two Forms of Structural Recursion
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
Dan Suciu, Limsoon Wong
SAT
2007
Springer
184views Hardware» more  SAT 2007»
16 years 19 days ago
Circuit Based Encoding of CNF Formula
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
Gilles Audemard, Lakhdar Sais