The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Adnan Darwiche: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hei Chan, Adnan Darwiche
    A Distance Measure for Bounding Probabilistic Belief Change. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:539-545 [Conf]
  2. Arthur Choi, Adnan Darwiche
    An Edge Deletion Semantics for Belief Propagation and its Practical Impact on Approximation Quality. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  3. Adnan Darwiche
    A Compiler for Deterministic, Decomposable Negation Normal Form. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 2002, pp:627-634 [Conf]
  4. Adnan Darwiche
    Utilizing Knowledge-Base Semantics in Graph-Based Algorithms. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, Vol. 1, 1996, pp:607-613 [Conf]
  5. Adnan Darwiche, Matthew L. Ginsberg
    A Symbolic Generalization of Probability Theory. [Citation Graph (0, 0)][DBLP]
    AAAI, 1992, pp:622-627 [Conf]
  6. Adnan Darwiche, Judea Pearl
    Symbolic Causal Networks. [Citation Graph (0, 0)][DBLP]
    AAAI, 1994, pp:238-244 [Conf]
  7. Adnan Darwiche, Gregory M. Provan
    The Effect of Observations on the Complexity of Model-Based Diagnosis. [Citation Graph (0, 0)][DBLP]
    AAAI/IAAI, 1997, pp:94-99 [Conf]
  8. Jinbo Huang, Mark Chavira, Adnan Darwiche
    Solving MAP Exactly by Searching on Compiled Arithmetic Circuits. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  9. Jinbo Huang, Adnan Darwiche
    On Compiling System Models for Faster and More Scalable Diagnosis. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:300-306 [Conf]
  10. Héctor Palacios, Blai Bonet, Adnan Darwiche, Hector Geffner
    Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations. [Citation Graph (0, 0)][DBLP]
    ICAPS, 2005, pp:141-150 [Conf]
  11. Adnan Darwiche
    Searching While Keeping a Trace: The Evolution from Satisfiability to Knowledge Compilation. [Citation Graph (0, 0)][DBLP]
    IJCAR, 2006, pp:3- [Conf]
  12. Adnan Darwiche
    New Advances in Compiling CNF into Decomposable Negation Normal Form. [Citation Graph (0, 0)][DBLP]
    ECAI, 2004, pp:328-332 [Conf]
  13. Adnan Darwiche, Mark Hopkins
    Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2001, pp:180-191 [Conf]
  14. James D. Park, Adnan Darwiche
    Morphing the Hugin and Shenoy-Shafer Architectures. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2003, pp:149-160 [Conf]
  15. Jinbo Huang, Adnan Darwiche
    Toward Good Elimination Orders for Symbolic SAT Solving. [Citation Graph (0, 0)][DBLP]
    ICTAI, 2004, pp:566-573 [Conf]
  16. David Allen, Adnan Darwiche
    Optimal Time-Space Tradeoff in Probabilistic Inference. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:969-975 [Conf]
  17. Hei Chan, Adnan Darwiche
    On the Revision of Probabilistic Beliefs using Uncertain Evidence. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:99-105 [Conf]
  18. Hei Chan, Adnan Darwiche
    Sensitivity Analysis in Markov Networks. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:1300-1305 [Conf]
  19. Mark Chavira, Adnan Darwiche
    Compiling Bayesian Networks with Local Structure. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:1306-1312 [Conf]
  20. Adnan Darwiche
    Model-Based Diagnosis using Causal Networks. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:211-219 [Conf]
  21. Adnan Darwiche
    Compiling Knowledge into Decomposable Negation Normal Form. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:284-289 [Conf]
  22. Adnan Darwiche
    Utilizing Device Behavior in Structure-Based Diagnosis. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1999, pp:1096-1101 [Conf]
  23. Adnan Darwiche, Pierre Marquis
    A Perspective on Knowledge Compilation. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2001, pp:175-182 [Conf]
  24. Jinbo Huang, Adnan Darwiche
    A Structure-Based Variable Ordering Heuristic for SAT. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2003, pp:1167-1172 [Conf]
  25. Jinbo Huang, Adnan Darwiche
    DPLL with a Trace: From SAT to Knowledge Compilation. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:156-162 [Conf]
  26. Mark Chavira, Adnan Darwiche
    Compiling Bayesian Networks Using Variable Elimination. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:2443-2449 [Conf]
  27. Adnan Darwiche
    A Logical Approach to Factoring Belief Networks. [Citation Graph (0, 0)][DBLP]
    KR, 2002, pp:409-420 [Conf]
  28. Adnan Darwiche
    Compiling Devices: A Structure-Based Approach. [Citation Graph (0, 0)][DBLP]
    KR, 1998, pp:156-155 [Conf]
  29. James D. Park, Adnan Darwiche
    A Differential Semantics for Jointree Algorithms. [Citation Graph (0, 0)][DBLP]
    NIPS, 2002, pp:785-784 [Conf]
  30. Adnan Darwiche, Pierre Marquis
    Compilation of propositional weighted bases. [Citation Graph (0, 0)][DBLP]
    NMR, 2002, pp:6-14 [Conf]
  31. David Allen, Adnan Darwiche
    Optimal Time-Space Tradeoff in Probabilistic Inference. [Citation Graph (0, 0)][DBLP]
    Probabilistic Graphical Models, 2002, pp:- [Conf]
  32. Mark Hopkins, Adnan Darwiche
    A Practical Relaxation of Constant-Factor Treewidth Approximation Algorithms. [Citation Graph (0, 0)][DBLP]
    Probabilistic Graphical Models, 2002, pp:- [Conf]
  33. Jinbo Huang, Adnan Darwiche
    Using DPLL for Efficient OBDD Construction. [Citation Graph (0, 0)][DBLP]
    SAT, 2004, pp:- [Conf]
  34. Jinbo Huang, Adnan Darwiche
    Using DPLL for Efficient OBDD Construction. [Citation Graph (0, 0)][DBLP]
    SAT (Selected Papers, 2004, pp:157-172 [Conf]
  35. Mark Chavira, Adnan Darwiche
    Encoding CNFs to Empower Component Analysis. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:61-74 [Conf]
  36. Yuliya Zabiyaka, Adnan Darwiche
    Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies. [Citation Graph (0, 0)][DBLP]
    SAT, 2006, pp:116-129 [Conf]
  37. Adnan Darwiche, Judea Pearl
    On the Logic of iterated Belief Revision. [Citation Graph (0, 0)][DBLP]
    TARK, 1994, pp:5-23 [Conf]
  38. David Allen, Adnan Darwiche
    New Advances in Inference by Recursive Conditioning. [Citation Graph (0, 0)][DBLP]
    UAI, 2003, pp:2-10 [Conf]
  39. Hei Chan, Adnan Darwiche
    When do Numbers Really Matter? [Citation Graph (0, 0)][DBLP]
    UAI, 2001, pp:65-74 [Conf]
  40. Hei Chan, Adnan Darwiche
    Reasoning about Bayesian Network Classifiers. [Citation Graph (0, 0)][DBLP]
    UAI, 2003, pp:107-115 [Conf]
  41. Adnan Darwiche
    A Differential Approach to Inference in Bayesian Networks. [Citation Graph (0, 0)][DBLP]
    UAI, 2000, pp:123-132 [Conf]
  42. Adnan Darwiche
    Any-Space Probabilistic Inference. [Citation Graph (0, 0)][DBLP]
    UAI, 2000, pp:133-142 [Conf]
  43. Adnan Darwiche
    Objection-based Causal Exception Networks. [Citation Graph (0, 0)][DBLP]
    UAI, 1992, pp:67-73 [Conf]
  44. Adnan Darwiche
    Argument Calculus and Networks. [Citation Graph (0, 0)][DBLP]
    UAI, 1993, pp:420-427 [Conf]
  45. Adnan Darwiche
    Conditioning Algorithms for Exact and Approximate Inference in Causal Networks. [Citation Graph (0, 0)][DBLP]
    UAI, 1995, pp:99-107 [Conf]
  46. Adnan Darwiche
    Dynamic Jointrees. [Citation Graph (0, 0)][DBLP]
    UAI, 1998, pp:97-104 [Conf]
  47. Adnan Darwiche, Moisés Goldszmidt
    Action Networks: A Framework for Reasoning about Actions and Change under Uncertainty. [Citation Graph (0, 0)][DBLP]
    UAI, 1994, pp:136-144 [Conf]
  48. Adnan Darwiche, Moisés Goldszmidt
    On the Relation between Kappa Calculus and Probabilistic Reasoning. [Citation Graph (0, 0)][DBLP]
    UAI, 1994, pp:145-153 [Conf]
  49. Adnan Darwiche, Gregory M. Provan
    Query DAGs: A practical paradigm for implementing belief-network inference. [Citation Graph (0, 0)][DBLP]
    UAI, 1996, pp:203-210 [Conf]
  50. Adnan Darwiche, Gregory M. Provan
    A Standard Approach for Optimizing Belief Network Inference Using Query DAGs. [Citation Graph (0, 0)][DBLP]
    UAI, 1997, pp:116-123 [Conf]
  51. James D. Park, Adnan Darwiche
    Approximating MAP using Local Search. [Citation Graph (0, 0)][DBLP]
    UAI, 2001, pp:403-410 [Conf]
  52. James D. Park, Adnan Darwiche
    Solving MAP Exactly using Systematic Search. [Citation Graph (0, 0)][DBLP]
    UAI, 2003, pp:459-468 [Conf]
  53. Hei Chan, Adnan Darwiche
    On the revision of probabilistic beliefs using uncertain evidence. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2005, v:163, n:1, pp:67-90 [Journal]
  54. Adnan Darwiche
    Recursive conditioning. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2001, v:126, n:1-2, pp:5-41 [Journal]
  55. Adnan Darwiche
    A Logical Notion of Conditional Independence: Properties and Application. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:97, n:1-2, pp:45-82 [Journal]
  56. Adnan Darwiche, Pierre Marquis
    Compiling propositional weighted bases. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:157, n:1-2, pp:81-113 [Journal]
  57. Adnan Darwiche, Judea Pearl
    On the Logic of Iterated Belief Revision. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 1997, v:89, n:1-2, pp:1-29 [Journal]
  58. James D. Park, Adnan Darwiche
    A differential semantics for jointree algorithms. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2004, v:156, n:2, pp:197-216 [Journal]
  59. Adnan Darwiche
    Model-Based Diagnosis under Real-World Constraints. [Citation Graph (0, 0)][DBLP]
    AI Magazine, 2000, v:21, n:2, pp:57-73 [Journal]
  60. Adnan Darwiche
    On the tractable counting of theory models and its application to belief revision and truth maintenance [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  61. Adnan Darwiche, Pierre Marquis
    Compilation of Propositional Weighted Bases [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  62. Adnan Darwiche, Gregory M. Provan
    Query DAGs: A Practical Paradigm for Implementing Belief-Network Inference [Citation Graph (0, 0)][DBLP]
    CoRR, 1997, v:0, n:, pp:- [Journal]
  63. Adnan Darwiche
    Model-Based Diagnosis using Structured System Descriptions [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  64. Hei Chan, Adnan Darwiche
    A distance measure for bounding probabilistic belief change. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 2005, v:38, n:2, pp:149-174 [Journal]
  65. Mark Chavira, Adnan Darwiche, Manfred Jaeger
    Compiling relational Bayesian networks for exact inference. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 2006, v:42, n:1-2, pp:4-20 [Journal]
  66. Adnan Darwiche
    Constant-space reasoning in dynamic Bayesian networks. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 2001, v:26, n:3, pp:161-178 [Journal]
  67. Cecil Huang, Adnan Darwiche
    Inference in belief networks: A procedural guide. [Citation Graph (0, 0)][DBLP]
    Int. J. Approx. Reasoning, 1996, v:15, n:3, pp:225-263 [Journal]
  68. Adnan Darwiche
    Decomposable negation normal form. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:4, pp:608-647 [Journal]
  69. Adnan Darwiche
    A differential approach to inference in Bayesian networks. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:3, pp:280-305 [Journal]
  70. Hei Chan, Adnan Darwiche
    When do Numbers Really Matter? [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2002, v:17, n:, pp:265-287 [Journal]
  71. Adnan Darwiche
    Model-Based Diagnosis using Structured System Descriptions. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 1998, v:8, n:, pp:165-222 [Journal]
  72. Adnan Darwiche, Pierre Marquis
    A Knowledge Compilation Map. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2002, v:17, n:, pp:229-264 [Journal]
  73. Adnan Darwiche, Gregory M. Provan
    Query DAGs: A Practical Paradigm for Implementing Belief-Network Inference. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 1997, v:6, n:, pp:147-176 [Journal]
  74. James D. Park, Adnan Darwiche
    Complexity Results and Approximation Strategies for MAP Explanations. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2004, v:21, n:, pp:101-133 [Journal]
  75. Adnan Darwiche
    On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2001, v:11, n:1-2, pp:11-34 [Journal]
  76. Knot Pipatsrisawat, Adnan Darwiche
    A Lightweight Component Caching Scheme for Satisfiability Solvers. [Citation Graph (0, 0)][DBLP]
    SAT, 2007, pp:294-299 [Conf]
  77. Mark Chavira, David Allen, Adnan Darwiche
    Exploiting Evidence in Probabilistic Inference. [Citation Graph (0, 0)][DBLP]
    UAI, 2005, pp:112-127 [Conf]
  78. Adnan Darwiche, Hei Chan, Arthur Choi
    On Bayesian Network Approximation by Edge Deletion. [Citation Graph (0, 0)][DBLP]
    UAI, 2005, pp:128-135 [Conf]
  79. Hei Chan, Adnan Darwiche
    Sensitivity Analysis in Bayesian Networks: From Single to Multiple Parameters. [Citation Graph (0, 0)][DBLP]
    UAI, 2004, pp:67-75 [Conf]
  80. Hei Chan, Adnan Darwiche
    On the Robustness of Most Probable Explanations. [Citation Graph (0, 0)][DBLP]
    UAI, 2006, pp:- [Conf]
  81. Arthur Choi, Adnan Darwiche
    A Variational Approach for Approximating Bayesian Networks by Edge Deletion. [Citation Graph (0, 0)][DBLP]
    UAI, 2006, pp:- [Conf]
  82. Jinbo Huang, Adnan Darwiche
    The Language of Search. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2007, v:29, n:, pp:191-219 [Journal]

  83. Focusing Generalizations of Belief Propagation on Targeted Queries. [Citation Graph (, )][DBLP]


  84. A New Clause Learning Scheme for Efficient Unsatisfiability Proofs. [Citation Graph (, )][DBLP]


  85. Diagnosing Faults in Electrical Power Systems of Spacecraft and Aircraft. [Citation Graph (, )][DBLP]


  86. Many-Pairs Mutual Information for Adding Structure to Belief Propagation Approximations. [Citation Graph (, )][DBLP]


  87. New Compilation Languages Based on Structured Decomposability. [Citation Graph (, )][DBLP]


  88. A Lower Bound on the Size of Decomposable Negation Normal Form. [Citation Graph (, )][DBLP]


  89. Clone: Solving Weighted Max-SAT in a Reduced Search Space. [Citation Graph (, )][DBLP]


  90. Approximating Weighted Max-SAT Problems by Compensating for Relaxations. [Citation Graph (, )][DBLP]


  91. On the Power of Clause-Learning SAT Solvers with Restarts. [Citation Graph (, )][DBLP]


  92. Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications. [Citation Graph (, )][DBLP]


  93. On Decomposability and Interaction Functions. [Citation Graph (, )][DBLP]


  94. A New d-DNNF-Based Bound Computation Algorithm for Functional E-MAJSAT. [Citation Graph (, )][DBLP]


  95. Relax, Compensate and Then Recover: A Theory of Anytime, Approximate Inference. [Citation Graph (, )][DBLP]


  96. Width-Based Restart Policies for Clause-Learning Satisfiability Solvers. [Citation Graph (, )][DBLP]


  97. Approximating the Partition Function by Deleting and then Correcting for Model Edges. [Citation Graph (, )][DBLP]


  98. Efficient Genome Wide Tagging by Reduction to SAT. [Citation Graph (, )][DBLP]


  99. On probabilistic inference by weighted model counting. [Citation Graph (, )][DBLP]


  100. Optimal algorithms for haplotype assembly from whole-genome sequence data. [Citation Graph (, )][DBLP]


Search in 1.267secs, Finished in 1.270secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002