Sciweavers

5084 search results - page 200 / 1017
» Proving Possibility Properties
Sort
View
FMOODS
2008
15 years 7 months ago
Semantic Foundations and Inference of Non-null Annotations
This paper proposes a semantics-based automatic null pointer analysis for inferring non-null annotations of fields in objectoriented programs. The analysis is formulated for a mini...
Laurent Hubert, Thomas P. Jensen, David Pichardie
IJCAI
1997
15 years 7 months ago
Tractable Cover Compilations
Tractable covers are introduced as a new ap­ proach to equivalence-preserving compilation of propositional knowledge bases. First, a gen­ eral framework is presented. Then, two ...
Yacine Boufkhad, Éric Grégoire, Pier...
SODA
1990
ACM
49views Algorithms» more  SODA 1990»
15 years 7 months ago
Factor Refinement
Let O be an order of an algebraic number field. It was shown by Ge that given a factorization of an O-ideal a into a product of O-ideals it is possible to compute in polynomial tim...
Eric Bach, James R. Driscoll, Jeffrey Shallit
AAAI
2008
15 years 7 months ago
Computer-Aided Proofs of Arrow's and Other Impossibility Theorems
Arrow’s Impossibility Theorem is one of the landmark results in social choice theory. Over the years since the theorem was proved in 1950, quite a few alternative proofs have be...
Fangzhen Lin, Pingzhong Tang
ARSCOM
2008
65views more  ARSCOM 2008»
15 years 6 months ago
On the non-existence of a maximal partial spread of size 76 in PG(3, 9)
We prove the non-existence of maximal partial spreads of size 76 in PG(3, 9). Relying on the classification of the minimal blocking sets of size 15 in PG(2, 9) [22], we show that ...
Olof Heden, Stefano Marcugini, Fernanda Pambianco,...