Sciweavers

1943 search results - page 74 / 389
» Ordering Default Theories
Sort
View
FMCAD
2008
Springer
15 years 1 months ago
A Theory of Mutations with Applications to Vacuity, Coverage, and Fault Tolerance
The quality of formal specifications and the circuits they are written for can be evaluated through checks such as vacuity and coverage. Both checks involve mutations to the specif...
Orna Kupferman, Wenchao Li, Sanjit A. Seshia
AICOM
2010
129views more  AICOM 2010»
14 years 12 months ago
Automated theorem proving in quasigroup and loop theory
We survey all known results in the area of quasigroup and loop theory to have been obtained with the assistance of automated theorem provers. We provide both informal and formal d...
J. D. Phillips, David Stanovský
AML
2005
53views more  AML 2005»
14 years 11 months ago
Models of set theory with definable ordinals
A DO model (here also referred to a Paris model) is a model M of set theory all of whose ordinals are first order definable in M. Jeffrey Paris (1973) initiated the study of DO mo...
Ali Enayat
EUROCAST
2003
Springer
105views Hardware» more  EUROCAST 2003»
15 years 5 months ago
A Self-adaptive Model for Selective Pressure Handling within the Theory of Genetic Algorithms
In this paper we introduce a new generic selection method for Genetic Algorithms. The main difference of this selection principle in contrast to conventional selection models is g...
Michael Affenzeller, Stefan Wagner 0002
ALENEX
2009
191views Algorithms» more  ALENEX 2009»
15 years 29 days ago
Theory and Practise of Monotone Minimal Perfect Hashing
Minimal perfect hash functions have been shown to be useful to compress data in several data management tasks. In particular, order-preserving minimal perfect hash functions [10] ...
Djamal Belazzougui, Paolo Boldi, Rasmus Pagh, Seba...