Adnan Darwiche - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

On the power of clause-learning SAT solvers as resolution enginesKnot Pipatsrisawat, Adnan Darwiche. ai, 175(2):512-525, 2011. [doi]

2010

Relax, Compensate and Then Recover: A Theory of Anytime, Approximate InferenceAdnan Darwiche. jelia 2010: 7-9 [doi]

Bayesian networksAdnan Darwiche. CACM, 53(12):80-90, 2010. [doi]

Optimal algorithms for haplotype assembly from whole-genome sequence dataDan He, Arthur Choi, Knot Pipatsrisawat, Adnan Darwiche, Eleazar Eskin. bioinformatics, 26(12):183-190, 2010. [doi]

Probabilistic Model-Based Diagnosis: An Electrical Power System Case StudyOle J. Mengshoel, Mark Chavira, Keith Cascio, Scott Poll, Adnan Darwiche, N. Serdar Uckun. tsmc, 40(5):874-885, 2010. [doi]

A Lower Bound on the Size of Decomposable Negation Normal FormThammanit Pipatsrisawat, Adnan Darwiche. AAAI 2010: [doi]

On Decomposability and Interaction FunctionsKnot Pipatsrisawat, Adnan Darwiche. ecai 2010: 9-14 [doi]

Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical ImplicationsKnot Pipatsrisawat, Adnan Darwiche. ecai 2010: 3-8 [doi]

On Modern Clause-Learning Satisfiability SolversKnot Pipatsrisawat, Adnan Darwiche. JAR, 44(3):277-301, 2010. [doi]

Towards software health management with bayesian networksJohann Schumann, Ole J. Mengshoel, Ashok N. Srivastava, Adnan Darwiche. FSE 2010: 331-336 [doi]

2009

Approximating Weighted Max-SAT Problems by Compensating for RelaxationsArthur Choi, Trevor Standley, Adnan Darwiche. cp 2009: 211-225 [doi]

Complete AlgorithmsAdnan Darwiche, Knot Pipatsrisawat. In Armin Biere, Marijn Heule, Hans van Maaren, Toby Walsh, editors, Handbook of Satisfiability. Volume 185 of Frontiers in Artificial Intelligence and Applications, pages 99-130, IOS Press, 2009. [doi]

Modeling and Reasoning with Bayesian NetworksAdnan Darwiche. Cambridge University Press, 2009. [doi]

On the Power of Clause-Learning SAT Solvers with RestartsKnot Pipatsrisawat, Adnan Darwiche. cp 2009: 654-668 [doi]

Width-Based Restart Policies for Clause-Learning Satisfiability SolversKnot Pipatsrisawat, Adnan Darwiche. sat 2009: 341-355 [doi]

A New d-DNNF-Based Bound Computation Algorithm for Functional E-MAJSATKnot Pipatsrisawat, Adnan Darwiche. IJCAI 2009: 590-595 [doi]

2008

RC_Link: Genetic linkage analysis using Bayesian networksDavid Allen, Adnan Darwiche. ijar, 48(2):499-525, 2008. [doi]

On probabilistic inference by weighted model countingMark Chavira, Adnan Darwiche. ai, 172(6-7):772-799, 2008. [doi]

Many-Pairs Mutual Information for Adding Structure to Belief Propagation ApproximationsArthur Choi, Adnan Darwiche. AAAI 2008: 1031-1036

Focusing Generalizations of Belief Propagation on Targeted QueriesArthur Choi, Adnan Darwiche. AAAI 2008: 1024-1030

Efficient Genome Wide Tagging by Reduction to SATArthur Choi, Noah Zaitlen, Buhm Han, Knot Pipatsrisawat, Adnan Darwiche, Eleazar Eskin. wabi 2008: 135-147 [doi]

Approximating the Partition Function by Deleting and then Correcting for Model EdgesArthur Choi, Adnan Darwiche. uai 2008: 79-87 [doi]

Diagnosing Faults in Electrical Power Systems of Spacecraft and AircraftOle J. Mengshoel, Adnan Darwiche, Keith Cascio, Mark Chavira, Scott Poll, N. Serdar Uckun. AAAI 2008: 1699-1705

A New Clause Learning Scheme for Efficient Unsatisfiability ProofsKnot Pipatsrisawat, Adnan Darwiche. AAAI 2008: 1481-1484

Solving Weighted Max-SAT Problems in a Reduced Search Space: A Performance AnalysisKnot Pipatsrisawat, Akop Palyan, Mark Chavira, Arthur Choi, Adnan Darwiche. jsat, 4(2-4):191-217, 2008. [doi]

New Compilation Languages Based on Structured DecomposabilityKnot Pipatsrisawat, Adnan Darwiche. AAAI 2008: 517-522

2007

2006

On the Robustness of Most Probable ExplanationsHei Chan, Adnan Darwiche. uai 2006: [doi]

Compiling relational Bayesian networks for exact inferenceMark Chavira, Adnan Darwiche, Manfred Jaeger. ijar, 42(1-2):4-20, 2006. [doi]

Encoding CNFs to Empower Component AnalysisMark Chavira, Adnan Darwiche. sat 2006: 61-74 [doi]

An Edge Deletion Semantics for Belief Propagation and its Practical Impact on Approximation QualityArthur Choi, Adnan Darwiche. AAAI 2006:

A Variational Approach for Approximating Bayesian Networks by Edge DeletionArthur Choi, Adnan Darwiche. uai 2006: [doi]

Searching While Keeping a Trace: The Evolution from Satisfiability to Knowledge CompilationAdnan Darwiche. cade 2006: 3 [doi]

Solving MAP Exactly by Searching on Compiled Arithmetic CircuitsJinbo Huang, Mark Chavira, Adnan Darwiche. AAAI 2006:

Functional Treewidth: Bounding Complexity in the Presence of Functional DependenciesYuliya Zabiyaka, Adnan Darwiche. sat 2006: 116-129 [doi]

2005

A distance measure for bounding probabilistic belief changeHei Chan, Adnan Darwiche. ijar, 38(2):149-174, 2005. [doi]

On the revision of probabilistic beliefs using uncertain evidenceHei Chan, Adnan Darwiche. ai, 163(1):67-90, 2005. [doi]

Sensitivity Analysis in Markov NetworksHei Chan, Adnan Darwiche. IJCAI 2005: 1300-1305 [doi]

Exploiting Evidence in Probabilistic InferenceMark Chavira, David Allen, Adnan Darwiche. uai 2005: 112-127 [doi]

Compiling Bayesian Networks with Local StructureMark Chavira, Adnan Darwiche. IJCAI 2005: 1306-1312 [doi]

On Bayesian Network Approximation by Edge DeletionAdnan Darwiche, Hei Chan, Arthur Choi. uai 2005: 128-135 [doi]

DPLL with a Trace: From SAT to Knowledge CompilationJinbo Huang, Adnan Darwiche. IJCAI 2005: 156-162 [doi]

On Compiling System Models for Faster and More Scalable DiagnosisJinbo Huang, Adnan Darwiche. AAAI 2005: 300-306

Pruning Conformant Plans by Counting Models on Compiled d-DNNF RepresentationsHéctor Palacios, Blai Bonet, Adnan Darwiche, Hector Geffner. aips 2005: 141-150

2004

Sensitivity Analysis in Bayesian Networks: From Single to Multiple ParametersHei Chan, Adnan Darwiche. uai 2004: 67-75 [doi]

New Advances in Compiling CNF into Decomposable Negation Normal FormAdnan Darwiche. ecai 2004: 328-332

Compiling propositional weighted basesAdnan Darwiche, Pierre Marquis. ai, 157(1-2):81-113, 2004. [doi]

Toward Good Elimination Orders for Symbolic SAT SolvingJinbo Huang, Adnan Darwiche. ictai 2004: 566-573 [doi]

Using DPLL for Efficient OBDD ConstructionJinbo Huang, Adnan Darwiche. sat 2005: 157-172 [doi]

Using DPLL for Efficient OBDD ConstructionJinbo Huang, Adnan Darwiche. sat 2004: [doi]

Complexity Results and Approximation Strategies for MAP ExplanationsJames D. Park, Adnan Darwiche. jair, 21:101-133, 2004. [doi]

A differential semantics for jointree algorithmsJames D. Park, Adnan Darwiche. ai, 156(2):197-216, 2004. [doi]

2003

2002

Optimal Time-Space Tradeoff in Probabilistic InferenceDavid Allen, Adnan Darwiche. pgm 2002: [doi]

A Distance Measure for Bounding Probabilistic Belief ChangeHei Chan, Adnan Darwiche. AAAI 2002: 539-545

When do Numbers Really Matter?Hei Chan, Adnan Darwiche. jair, 17:265-287, 2002. [doi]

UAI 02, Proceedings of the 18th Conference in Uncertainty in Artificial Intelligence, University of Alberta, Edmonton, Alberta, Canada, August 1-4, 2002Adnan Darwiche, Nir Friedman, editors, Morgan Kaufmann, 2002.

Compilation of propositional weighted basesAdnan Darwiche, Pierre Marquis. lpnmr 2002: 6-14

A Knowledge Compilation MapAdnan Darwiche, Pierre Marquis. jair, 17:229-264, 2002. [doi]

A Compiler for Deterministic, Decomposable Negation Normal FormAdnan Darwiche. AAAI 2002: 627-634

A Logical Approach to Factoring Belief NetworksAdnan Darwiche. kr 2002: 409-420

A Practical Relaxation of Constant-Factor Treewidth Approximation AlgorithmsMark Hopkins, Adnan Darwiche. pgm 2002: [doi]

A Differential Semantics for Jointree AlgorithmsJames D. Park, Adnan Darwiche. nips 2003: 785-784 [doi]

2001

2000

Any-Space Probabilistic InferenceAdnan Darwiche. uai 2000: 133-142 [doi]

A Differential Approach to Inference in Bayesian NetworksAdnan Darwiche. uai 2000: 123-132 [doi]

Model-Based Diagnosis under Real-World ConstraintsAdnan Darwiche. aim, 21(2):57-73, 2000.

1999

Compiling Knowledge into Decomposable Negation Normal FormAdnan Darwiche. IJCAI 1999: 284-289

Utilizing Device Behavior in Structure-Based DiagnosisAdnan Darwiche. IJCAI 1999: 1096-1101

1998

Dynamic JointreesAdnan Darwiche. uai 1998: 97-104 [doi]

Compiling Devices: A Structure-Based ApproachAdnan Darwiche. kr 1998: 156-155

Model-Based Diagnosis using Structured System DescriptionsAdnan Darwiche. jair, 8:165-222, 1998. [doi]

1997

1996

Query DAGs: A practical paradigm for implementing belief-network inferenceAdnan Darwiche, Gregory M. Provan. uai 1996: 203-210 [doi]

Utilizing Knowledge-Base Semantics in Graph-Based AlgorithmsAdnan Darwiche. AAAI 1996: 607-613

Inference in belief networks: A procedural guideCecil Huang, Adnan Darwiche. ijar, 15(3):225-263, 1996. [doi]

1995

Conditioning Algorithms for Exact and Approximate Inference in Causal NetworksAdnan Darwiche. uai 1995: 99-107 [doi]

Model-Based Diagnosis using Causal NetworksAdnan Darwiche. IJCAI 1995: 211-219

1994

Symbolic Causal NetworksAdnan Darwiche, Judea Pearl. AAAI 1994: 238-244

PreviousNext