| 2013 | ||
|---|---|---|
| i30 | ||
| i29 | Adnan Darwiche: A Differential Approach to Inference in Bayesian Networks. CoRR abs/1301.3847 (2013) | |
| i28 | ||
| i27 | Adnan Darwiche, Nir Friedman: Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (2002). CoRR abs/1301.4608 (2013) | |
| i26 | ||
| i25 | Adnan Darwiche, Gregory M. Provan: A Standard Approach for Optimizing Belief Network Inference using Query DAGs. CoRR abs/1302.1532 (2013) | |
| i24 | Adnan Darwiche: Conditioning Methods for Exact and Approximate Inference in Causal Networks. CoRR abs/1302.4939 (2013) | |
| i23 | Adnan Darwiche, Moisés Goldszmidt: Action Networks: A Framework for Reasoning about Actions and Change under Uncertainty. CoRR abs/1302.6796 (2013) | |
| i22 | Adnan Darwiche, Moisés Goldszmidt: On the Relation between Kappa Calculus and Probabilistic Reasoning. CoRR abs/1302.6797 (2013) | |
| i21 | ||
| i20 | ||
| 2012 | ||
| j29 | Arthur Choi, Yexiang Xue, Adnan Darwiche: Same-decision probability: A confidence measure for threshold-based decisions. Int. J. Approx. Reasoning 53(9): 1415-1428 (2012) | |
| c84 | Yexiang Xue, Arthur Choi, Adnan Darwiche: Basing Decisions on Sentences in Decision Diagrams. AAAI 2012 | |
| c83 | ||
| c82 | Guy Van den Broeck, Arthur Choi, Adnan Darwiche: Lifted Relax, Compensate and then Recover: From Approximate to Exact Lifted Probabilistic Inference. UAI 2012: 131-141 | |
| c81 | Khaled S. Refaat, Arthur Choi, Adnan Darwiche: New Advances and Theoretical Insights into EDML. UAI 2012: 705-714 | |
| i19 | Arthur Choi, Khaled S. Refaat, Adnan Darwiche: EDML: A Method for Learning Parameters in Bayesian Networks. CoRR abs/1202.3709 (2012) | |
| i18 | Arthur Choi, Adnan Darwiche: Approximating the Partition Function by Deleting and then Correcting for Model Edges. CoRR abs/1206.3241 (2012) | |
| i17 | Arthur Choi, Mark Chavira, Adnan Darwiche: Node Splitting: A Scheme for Generating Upper Bounds in Bayesian Networks. CoRR abs/1206.5251 (2012) | |
| i16 | Arthur Choi, Hei Chan, Adnan Darwiche: On Bayesian Network Approximation by Edge Deletion. CoRR abs/1207.1370 (2012) | |
| i15 | Mark Chavira, David Allen, Adnan Darwiche: Exploiting Evidence in Probabilistic Inference. CoRR abs/1207.1372 (2012) | |
| i14 | Hei Chan, Adnan Darwiche: Sensitivity Analysis in Bayesian Networks: From Single to Multiple Parameters. CoRR abs/1207.4124 (2012) | |
| i13 | Guy Van den Broeck, Arthur Choi, Adnan Darwiche: Lifted Relax, Compensate and then Recover: From Approximate to Exact Lifted Probabilistic Inference. CoRR abs/1210.4840 (2012) | |
| i12 | Khaled S. Refaat, Arthur Choi, Adnan Darwiche: New Advances and Theoretical Insights into EDML. CoRR abs/1210.4910 (2012) | |
| i11 | David Allen, Adnan Darwiche: New Advances in Inference by Recursive Conditioning. CoRR abs/1212.2455 (2012) | |
| i10 | ||
| i9 | James D. Park, Adnan Darwiche: Solving MAP Exactly using Systematic Search. CoRR abs/1212.2497 (2012) | |
| 2011 | ||
| j28 | Knot Pipatsrisawat, Adnan Darwiche: On the power of clause-learning SAT solvers as resolution engines. Artif. Intell. 175(2): 512-525 (2011) | |
| c80 | Adnan Darwiche: SDD: A New Canonical Representation of Propositional Knowledge Bases. IJCAI 2011: 819-826 | |
| c79 | Arthur Choi, Khaled S. Refaat, Adnan Darwiche: EDML: A Method for Learning Parameters in Bayesian Networks. UAI 2011: 115-124 | |
| i8 | ||
| i7 | ||
| i6 | Adnan Darwiche, James D. Park: Complexity Results and Approximation Strategies for MAP Explanations. CoRR abs/1107.0024 (2011) | |
| i5 | ||
| 2010 | ||
| j27 | Dan He, Arthur Choi, Knot Pipatsrisawat, Adnan Darwiche, Eleazar Eskin: Optimal algorithms for haplotype assembly from whole-genome sequence data. Bioinformatics [ISMB] 26(12): 183-190 (2010) | |
| j26 | ||
| j25 | Knot Pipatsrisawat, Adnan Darwiche: On Modern Clause-Learning Satisfiability Solvers. J. Autom. Reasoning 44(3): 277-301 (2010) | |
| j24 | Ole J. Mengshoel, Mark Chavira, Keith Cascio, Scott Poll, Adnan Darwiche, N. Serdar Uckun: Probabilistic Model-Based Diagnosis: An Electrical Power System Case Study. IEEE Transactions on Systems, Man, and Cybernetics, Part A 40(5): 874-885 (2010) | |
| c78 | Thammanit Pipatsrisawat, Adnan Darwiche: A Lower Bound on the Size of Decomposable Negation Normal Form. AAAI 2010 | |
| c77 | Knot Pipatsrisawat, Adnan Darwiche: Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications. ECAI 2010: 3-8 | |
| c76 | ||
| c75 | Adnan Darwiche: Relax, Compensate and Then Recover: A Theory of Anytime, Approximate Inference. JELIA 2010: 7-9 | |
| c74 | ||
| c73 | Johann Schumann, Ole J. Mengshoel, Ashok N. Srivastava, Adnan Darwiche: Towards software health management with bayesian networks. FoSER 2010: 331-336 | |
| 2009 | ||
| b1 | Adnan Darwiche: Modeling and Reasoning with Bayesian Networks. Cambridge University Press 2009, isbn 978-0-521-88438-9, pp. I-XII, 1-548 | |
| c72 | Arthur Choi, Trevor Standley, Adnan Darwiche: Approximating Weighted Max-SAT Problems by Compensating for Relaxations. CP 2009: 211-225 | |
| c71 | Knot Pipatsrisawat, Adnan Darwiche: On the Power of Clause-Learning SAT Solvers with Restarts. CP 2009: 654-668 | |
| c70 | Knot Pipatsrisawat, Adnan Darwiche: A New d-DNNF-Based Bound Computation Algorithm for Functional E-MAJSAT. IJCAI 2009: 590-595 | |
| c69 | Arthur Choi, Adnan Darwiche: Approximating MAP by Compensating for Structural Relaxations. NIPS 2009: 351-359 | |
| c68 | Knot Pipatsrisawat, Adnan Darwiche: Width-Based Restart Policies for Clause-Learning Satisfiability Solvers. SAT 2009: 341-355 | |
| p1 | ||
| 2008 | ||
| j23 | Mark Chavira, Adnan Darwiche: On probabilistic inference by weighted model counting. Artif. Intell. 172(6-7): 772-799 (2008) | |
| j22 | David Allen, Adnan Darwiche: RC_Link: Genetic linkage analysis using Bayesian networks. Int. J. Approx. Reasoning 48(2): 499-525 (2008) | |
| j21 | Knot Pipatsrisawat, Akop Palyan, Mark Chavira, Arthur Choi, Adnan Darwiche: Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance Analysis. JSAT 4(2-4): 191-217 (2008) | |
| c67 | Knot Pipatsrisawat, Adnan Darwiche: New Compilation Languages Based on Structured Decomposability. AAAI 2008: 517-522 | |
| c66 | Arthur Choi, Adnan Darwiche: Focusing Generalizations of Belief Propagation on Targeted Queries. AAAI 2008: 1024-1030 | |
| c65 | Arthur Choi, Adnan Darwiche: Many-Pairs Mutual Information for Adding Structure to Belief Propagation Approximations. AAAI 2008: 1031-1036 | |
| c64 | Knot Pipatsrisawat, Adnan Darwiche: A New Clause Learning Scheme for Efficient Unsatisfiability Proofs. AAAI 2008: 1481-1484 | |
| c63 | Ole J. Mengshoel, Adnan Darwiche, Keith Cascio, Mark Chavira, Scott Poll, N. Serdar Uckun: Diagnosing Faults in Electrical Power Systems of Spacecraft and Aircraft. AAAI 2008: 1699-1705 | |
| c62 | Arthur Choi, Adnan Darwiche: Approximating the Partition Function by Deleting and then Correcting for Model Edges. UAI 2008: 79-87 | |
| c61 | Arthur Choi, Noah Zaitlen, Buhm Han, Knot Pipatsrisawat, Adnan Darwiche, Eleazar Eskin: Efficient Genome Wide Tagging by Reduction to SAT. WABI 2008: 135-147 | |
| 2007 | ||
| j20 | Jinbo Huang, Adnan Darwiche: The Language of Search. J. Artif. Intell. Res. (JAIR) 29: 191-219 (2007) | |
| c60 | Knot Pipatsrisawat, Adnan Darwiche: Clone: Solving Weighted Max-SAT in a Reduced Search Space. Australian Conference on Artificial Intelligence 2007: 223-233 | |
| c59 | Mark Chavira, Adnan Darwiche: Compiling Bayesian Networks Using Variable Elimination. IJCAI 2007: 2443-2449 | |
| c58 | Knot Pipatsrisawat, Adnan Darwiche: A Lightweight Component Caching Scheme for Satisfiability Solvers. SAT 2007: 294-299 | |
| c57 | Arthur Choi, Mark Chavira, Adnan Darwiche: Node Splitting: A Scheme for Generating Upper Bounds in Bayesian Networks. UAI 2007: 57-66 | |
| 2006 | ||
| j19 | Mark Chavira, Adnan Darwiche, Manfred Jaeger: Compiling relational Bayesian networks for exact inference. Int. J. Approx. Reasoning 42(1-2): 4-20 (2006) | |
| c56 | Arthur Choi, Adnan Darwiche: An Edge Deletion Semantics for Belief Propagation and its Practical Impact on Approximation Quality. AAAI 2006: 1107-1114 | |
| c55 | Jinbo Huang, Mark Chavira, Adnan Darwiche: Solving MAP Exactly by Searching on Compiled Arithmetic Circuits. AAAI 2006: 1143-1148 | |
| c54 | Adnan Darwiche: Searching While Keeping a Trace: The Evolution from Satisfiability to Knowledge Compilation. IJCAR 2006: 3 | |
| c53 | ||
| c52 | Yuliya Zabiyaka, Adnan Darwiche: Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies. SAT 2006: 116-129 | |
| c51 | ||
| c50 | Arthur Choi, Adnan Darwiche: A Variational Approach for Approximating Bayesian Networks by Edge Deletion. UAI 2006 | |
| 2005 | ||
| j18 | Hei Chan, Adnan Darwiche: On the revision of probabilistic beliefs using uncertain evidence. Artif. Intell. 163(1): 67-90 (2005) | |
| j17 | Hei Chan, Adnan Darwiche: A distance measure for bounding probabilistic belief change. Int. J. Approx. Reasoning 38(2): 149-174 (2005) | |
| c49 | Jinbo Huang, Adnan Darwiche: On Compiling System Models for Faster and More Scalable Diagnosis. AAAI 2005: 300-306 | |
| c48 | Héctor Palacios, Blai Bonet, Adnan Darwiche, Hector Geffner: Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations. ICAPS 2005: 141-150 | |
| c47 | Jinbo Huang, Adnan Darwiche: DPLL with a Trace: From SAT to Knowledge Compilation. IJCAI 2005: 156-162 | |
| c46 | ||
| c45 | Mark Chavira, Adnan Darwiche: Compiling Bayesian Networks with Local Structure. IJCAI 2005: 1306-1312 | |
| c44 | Mark Chavira, David Allen, Adnan Darwiche: Exploiting Evidence in Probabilistic Inference. UAI 2005: 112-127 | |
| c43 | Adnan Darwiche, Hei Chan, Arthur Choi: On Bayesian Network Approximation by Edge Deletion. UAI 2005: 128-135 | |
| 2004 | ||
| j16 | James D. Park, Adnan Darwiche: A differential semantics for jointree algorithms. Artif. Intell. 156(2): 197-216 (2004) | |
| j15 | Adnan Darwiche, Pierre Marquis: Compiling propositional weighted bases. Artif. Intell. 157(1-2): 81-113 (2004) | |
| j14 | James D. Park, Adnan Darwiche: Complexity Results and Approximation Strategies for MAP Explanations. J. Artif. Intell. Res. (JAIR) 21: 101-133 (2004) | |
| c42 | Adnan Darwiche: New Advances in Compiling CNF into Decomposable Negation Normal Form. ECAI 2004: 328-332 | |
| c41 | Jinbo Huang, Adnan Darwiche: Toward Good Elimination Orders for Symbolic SAT Solving. ICTAI 2004: 566-573 | |
| c40 | ||
| c39 | Jinbo Huang, Adnan Darwiche: Using DPLL for Efficient OBDD Construction. SAT (Selected Papers 2004: 157-172 | |
| c38 | ||
| 2003 | ||
| j13 | Adnan Darwiche: A differential approach to inference in Bayesian networks. J. ACM 50(3): 280-305 (2003) | |
| c37 | James D. Park, Adnan Darwiche: Morphing the Hugin and Shenoy-Shafer Architectures. ECSQARU 2003: 149-160 | |
| c36 | Hei Chan, Adnan Darwiche: On the Revision of Probabilistic Beliefs using Uncertain Evidence. IJCAI 2003: 99-105 | |
| c35 | David Allen, Adnan Darwiche: Optimal Time-Space Tradeoff in Probabilistic Inference. IJCAI 2003: 969-975 | |
| c34 | Jinbo Huang, Adnan Darwiche: A Structure-Based Variable Ordering Heuristic for SAT. IJCAI 2003: 1167-1172 | |
| c33 | ||
| c32 | ||
| c31 | ||
| 2002 | ||
| j12 | Adnan Darwiche, Pierre Marquis: A Knowledge Compilation Map. J. Artif. Intell. Res. (JAIR) 17: 229-264 (2002) | |
| j11 | Hei Chan, Adnan Darwiche: When do Numbers Really Matter? J. Artif. Intell. Res. (JAIR) 17: 265-287 (2002) | |
| c30 | Hei Chan, Adnan Darwiche: A Distance Measure for Bounding Probabilistic Belief Change. AAAI/IAAI 2002: 539-545 | |
| c29 | Adnan Darwiche: A Compiler for Deterministic, Decomposable Negation Normal Form. AAAI/IAAI 2002: 627-634 | |
| c28 | ||
| c27 | ||
| c26 | ||
| c25 | David Allen, Adnan Darwiche: Optimal Time-Space Tradeoff in Probabilistic Inference. Probabilistic Graphical Models 2002 | |
| c24 | Mark Hopkins, Adnan Darwiche: A Practical Relaxation of Constant-Factor Treewidth Approximation Algorithms. Probabilistic Graphical Models 2002 | |
| e1 | Adnan Darwiche, Nir Friedman (Eds.): UAI '02, Proceedings of the 18th Conference in Uncertainty in Artificial Intelligence, University of Alberta, Edmonton, Alberta, Canada, August 1-4, 2002. Morgan Kaufmann 2002, isbn 1-55860-897-4 | |
| i4 | Adnan Darwiche, Pierre Marquis: Compilation of Propositional Weighted Bases. CoRR cs.AI/0207045 (2002) | |
| 2001 | ||
| j10 | ||
| j9 | Adnan Darwiche: Constant-space reasoning in dynamic Bayesian networks. Int. J. Approx. Reasoning 26(3): 161-178 (2001) | |
| j8 | ||
| j7 | Adnan Darwiche: On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision. Journal of Applied Non-Classical Logics 11(1-2): 11-34 (2001) | |
| c23 | Adnan Darwiche, Mark Hopkins: Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees. ECSQARU 2001: 180-191 | |
| c22 | ||
| c21 | ||
| c20 | ||
| 2000 | ||
| j6 | ||
| c19 | ||
| c18 | ||
| i3 | Adnan Darwiche: On the tractable counting of theory models and its application to belief revision and truth maintenance. CoRR cs.AI/0003044 (2000) | |
| 1999 | ||
| c17 | ||
| c16 | ||
| 1998 | ||
| j5 | Adnan Darwiche: Model-Based Diagnosis using Structured System Descriptions. J. Artif. Intell. Res. (JAIR) 8: 165-222 (1998) | |
| c15 | ||
| c14 | ||
| i2 | Adnan Darwiche: Model-Based Diagnosis using Structured System Descriptions. CoRR cs.AI/9806101 (1998) | |
| 1997 | ||
| j4 | Adnan Darwiche, Judea Pearl: On the Logic of Iterated Belief Revision. Artif. Intell. 89(1-2): 1-29 (1997) | |
| j3 | Adnan Darwiche: A Logical Notion of Conditional Independence: Properties and Application. Artif. Intell. 97(1-2): 45-82 (1997) | |
| j2 | Adnan Darwiche, Gregory M. Provan: Query DAGs: A Practical Paradigm for Implementing Belief-Network Inference. J. Artif. Intell. Res. (JAIR) 6: 147-176 (1997) | |
| c13 | Adnan Darwiche, Gregory M. Provan: The Effect of Observations on the Complexity of Model-Based Diagnosis. AAAI/IAAI 1997: 94-99 | |
| c12 | Adnan Darwiche, Gregory M. Provan: A Standard Approach for Optimizing Belief Network Inference Using Query DAGs. UAI 1997: 116-123 | |
| i1 | Adnan Darwiche, Gregory M. Provan: Query DAGs: A Practical Paradigm for Implementing Belief-Network Inference. CoRR cs.AI/9705101 (1997) | |
| 1996 | ||
| j1 | Cecil Huang, Adnan Darwiche: Inference in belief networks: A procedural guide. Int. J. Approx. Reasoning 15(3): 225-263 (1996) | |
| c11 | Adnan Darwiche: Utilizing Knowledge-Base Semantics in Graph-Based Algorithms. AAAI/IAAI, Vol. 1 1996: 607-613 | |
| c10 | Adnan Darwiche, Gregory M. Provan: Query DAGs: A practical paradigm for implementing belief-network inference. UAI 1996: 203-210 | |
| 1995 | ||
| c9 | ||
| c8 | Adnan Darwiche: Conditioning Algorithms for Exact and Approximate Inference in Causal Networks. UAI 1995: 99-107 | |
| 1994 | ||
| c7 | ||
| c6 | ||
| c5 | Adnan Darwiche, Moisés Goldszmidt: Action Networks: A Framework for Reasoning about Actions and Change under Uncertainty. UAI 1994: 136-144 | |
| c4 | Adnan Darwiche, Moisés Goldszmidt: On the Relation between Kappa Calculus and Probabilistic Reasoning. UAI 1994: 145-153 | |
| 1993 | ||
| c3 | ||
| 1992 | ||
| c2 | Adnan Darwiche, Matthew L. Ginsberg: A Symbolic Generalization of Probability Theory. AAAI 1992: 622-627 | |
| c1 | ||
Colors in the list of coauthors
Last update Thu May 23 21:33:45 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page