The following pages link to Adnan Darwiche (Q511783):
Displaying 46 items.
- (Q197132) (redirect page) (← links)
- Learning Bayesian network parameters under equivalence constraints (Q511784) (← links)
- On the power of clause-learning SAT solvers as resolution engines (Q543613) (← links)
- (Q588380) (redirect page) (← links)
- A differential semantics for jointree algorithms (Q814601) (← links)
- Compiling propositional weighted bases (Q814606) (← links)
- A logical notion of conditional independence: properties and applications (Q1127351) (← links)
- On the logic of iterated belief revision (Q1399119) (← links)
- On pruning with the MDL score (Q1687302) (← links)
- A distance measure for bounding probabilistic belief change (Q1770556) (← links)
- Inference in belief networks: A procedural guide (Q1809338) (← links)
- Verifying binarized neural networks by Angluin-style learning (Q2181945) (← links)
- Open-world probabilistic databases: semantics, algorithms, complexity (Q2238646) (← links)
- On the relative expressiveness of Bayesian and neural networks (Q2302782) (← links)
- Same-decision probability: a confidence measure for threshold-based decisions (Q2375339) (← links)
- On probabilistic inference by weighted model counting (Q2389636) (← links)
- On the revision of probabilistic beliefs using uncertain evidence (Q2457685) (← links)
- Compiling relational Bayesian networks for exact inference (Q2499043) (← links)
- (Q2996250) (← links)
- Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications (Q2999097) (← links)
- (Q2999098) (← links)
- A differential approach to inference in Bayesian networks (Q3452493) (← links)
- (Q3604006) (← links)
- (Q3624075) (← links)
- Modeling and Reasoning with Bayesian Networks (Q3632890) (← links)
- (Q4397012) (← links)
- (Q4411139) (← links)
- (Q4411140) (← links)
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision (Q4443390) (← links)
- (Q4639880) (← links)
- Relax, Compensate and Then Recover: A Theory of Anytime, Approximate Inference (Q4930749) (← links)
- (Q4999271) (← links)
- (Q4999317) (← links)
- On Quantifying Literals in Boolean Logic and its Applications to Explainable AI (Q5026182) (← links)
- Modeling and Reasoning with Bayesian Networks (Q5247392) (← links)
- (Q5283031) (← links)
- Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams (Q5326412) (← links)
- Algorithms and Applications for the Same-Decision Probability (Q5415763) (← links)
- Decomposable negation normal form (Q5441353) (← links)
- Theory and Applications of Satisfiability Testing (Q5714748) (← links)
- (Q5715665) (← links)
- Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies (Q5756566) (← links)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty (Q5900629) (← links)
- Recursive conditioning (Q5940818) (← links)
- Constant-space reasoning in dynamic Bayesian networks (Q5944710) (← links)
- On the (complete) reasons behind decisions (Q6117140) (← links)
