Exploiting Structure in Backtracking Algorithms for Propositional and Probabilistic Reasoning

Exploiting Structure in Backtracking Algorithms for Propositional and Probabilistic Reasoning

Show other versions (1)

Boolean propositional satisfiability (SAT) and probabilistic reasoning represent two core problems in AI. Backtracking based algorithms have been applied in both problems. In this thesis, I investigate structure-based techniques for solving real world SAT and Bayesian networks, such as software test...

Full description

Bibliographic Details
Main Author: Li, Wei
Language:en
Published: 2010
Subjects:
SAT
Model Counting
Bayesian networks
Backtracking Algorithms
Noisy-OR
Noisy-MAX
Computer Science
Online Access:http://hdl.handle.net/10012/5322

Internet

http://hdl.handle.net/10012/5322

Similar Items