Satisfiability Solvers - ppt download

Por um escritor misterioso

Last updated 17 abril 2025

Structured vs. Random Problems So far, we’ve been dealing with SAT problems that encode other problems Most not as hard as # of variables & clauses suggests Small crossword grid + medium-sized dictionary may turn into a big formula … but still a small puzzle at some level Unit propagation does a lot of work for you Clause learning picks up on the structure of the encoding But some random SAT problems really are hard! zChaff’s tricks don’t work so well here /425 Declarative Methods - J. Eisner
Sexual reproduction (another popular general technique – at least for evolutionary algorithms) Derive each new assignment by somehow combining two old assignments, not just modifying one ( sexual reproduction or crossover ) Parent 1. Parent Child 1. Child 2. Mutation. Good idea /425 Declarative Methods - J. Eisner. slide thanks to Russ Greiner and Dekang Lin (modified)