O'Reilly logo

Constraint Processing by Rina Dechter

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

E

earliest minimal conflict set, 163
easy CSPs, 85
easy problem classes, 85
ECLiPSe, 434
edges of graphs
hyperedges, 246
overview, 19
Einstein, Albert, 245
ELIM-BEL algorithm, 402–405
bucket elimination along ordering, 405
complexity, 407–408
derivation of, 402–404
ELIM-OPT algorithm and, 402, 404
ELIM-COND algorithm
DP-DR variant, 280–284
overview, 278–279
ELIM-COND-BEL algorithm, 410
ELIM-COUNT algorithm, 378–379
ELIM-MPE algorithm
complexity, 407–108
overview, 406–407
ELIM-OPT algorithm
complexity, 374–378
cost networks and, 373
deriving, 371–373
dynamic programming as, 374
ELIM-BEL algorithm and, 402, 404
ELIM-MPE algorithm and, 406
execution of, 382
incorporating hard constraints, 373–374
inference operation in each bucket, 380
mini-bucket ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required