125 search results - page 1 / 25 » Model Theory Makes Formulas Large |
101
Voted
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...
185
Voted
POPL
2008
ACM
15 years 12 months ago
2008
ACM
The C language definition leaves the sizes and layouts of types partially unspecified. When a C program makes assumptions about type layout, its semantics is defined only on platf...
112
click to vote
SAT
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
112
Voted
FMICS
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
AAAI
2000
15 years 1 months ago
2000
The random k-SAT model is extensively used to compare satisfiability algorithms or to find the best settings for the parameters of some algorithm. Conclusions are derived from the...