Adnan Darwiche
According to our database^{1},
Adnan Darwiche
authored at least 173 papers
between 1988 and 2020.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2018, "For contributions to the foundations and technology of automated reasoning".
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at cs.ucla.edu
On csauthors.net:
Bibliography
2020
A New Perspective on Learning ContextSpecific Independence.
CoRR, 2020
On Tractable Representations of Binary Neural Networks.
CoRR, 2020
An Advance on Variable Elimination with Applications to TensorBased Computation.
CoRR, 2020
On The Reasons Behind Decisions.
CoRR, 2020
Three Modern Roles for Logic in AI.
Proceedings of the 39th ACM SIGMODSIGACTSIGAI Symposium on Principles of Database Systems, 2020
2019
On the relative expressiveness of Bayesian and neural networks.
Int. J. Approx. Reason., 2019
Verifying Binarized Neural Networks by AngluinStyle Learning.
Proceedings of the Theory and Applications of Satisfiability Testing  SAT 2019, 2019
Conditional Independence in Testing Bayesian Networks.
Proceedings of the 36th International Conference on Machine Learning, 2019
Compiling Bayesian Network Classifiers into Decision Graphs.
Proceedings of the ThirtyThird AAAI Conference on Artificial Intelligence, 2019
Structured Bayesian Networks: From Inference to Learning with Routes.
Proceedings of the ThirtyThird AAAI Conference on Artificial Intelligence, 2019
2018
An Exhaustive DPLL Algorithm for Model Counting.
J. Artif. Intell. Res., 2018
On pruning with the MDL Score.
Int. J. Approx. Reason., 2018
Humanlevel intelligence or animallike abilities?
Commun. ACM, 2018
Formal Verification of Bayesian Network Classifiers.
Proceedings of the International Conference on Probabilistic Graphical Models, 2018
On the Relative Expressiveness of Bayesian and Neural Networks.
Proceedings of the International Conference on Probabilistic Graphical Models, 2018
A Symbolic Approach to Explaining Bayesian Network Classifiers.
Proceedings of the TwentySeventh International Joint Conference on Artificial Intelligence, 2018
Conditional PSDDs: Modeling and Learning With Modular Knowledge.
Proceedings of the ThirtySecond AAAI Conference on Artificial Intelligence, 2018
2017
Recent Trends in Knowledge Compilation (Dagstuhl Seminar 17381).
Dagstuhl Reports, 2017
On Compiling DNNFs without Determinism.
CoRR, 2017
Learning Bayesian network parameters under equivalence constraints.
Artif. Intell., 2017
A Tractable Probabilistic Model for Subset Selection.
Proceedings of the ThirtyThird Conference on Uncertainty in Artificial Intelligence, 2017
Tractability in Structured Probability Spaces.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017
Optimal Feature Selection for Decision Robustness in Bayesian Networks.
Proceedings of the TwentySixth International Joint Conference on Artificial Intelligence, 2017
OpenWorld Probabilistic Databases: An Abridged Report.
Proceedings of the TwentySixth International Joint Conference on Artificial Intelligence, 2017
On Relaxing Determinism in Arithmetic Circuits.
Proceedings of the 34th International Conference on Machine Learning, 2017
2016
Reports of the 2016 AAAI Workshop Program.
AI Magazine, 2016
Tractable Operations for Arithmetic Circuits of Probabilistic Models.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
Learning Bayesian networks with ancestral constraints.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016
Solving PP^{PP}Complete Problems Using Knowledge Compilation.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016
OpenWorld Probabilistic Databases.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, 2016
Open World Probabilistic Databases (Extended Abstract).
Proceedings of the 29th International Workshop on Description Logics, 2016
Enumerating Equivalence Classes of Bayesian Networks using EC Graphs.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016
Preface: The Beyond NP Workshop.
Proceedings of the Beyond NP, 2016
Structured Features in Naive Bayes Classification.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016
2015
Dual Decomposition from the Perspective of Relax, Compensate and then Recover.
CoRR, 2015
An Upper Bound on the Global Optimum in Parameter Estimation.
Proceedings of the ThirtyFirst Conference on Uncertainty in Artificial Intelligence, 2015
Computer Adaptive Testing Using the SameDecision Probability.
Proceedings of the Twelfth UAI Bayesian Modeling Applications Workshop (BMAW 2015) colocated with the 31st Conference on Uncertainty in Artificial Intelligence (UAI 2015), 2015
Efficient Algorithms for Bayesian Network Parameter Learning from Incomplete Data.
Proceedings of the ThirtyFirst Conference on Uncertainty in Artificial Intelligence, 2015
Tractable Learning for Complex Probability Queries.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015
Data Compression for Learning MRF Parameters.
Proceedings of the TwentyFourth International Joint Conference on Artificial Intelligence, 2015
A TopDown Compiler for Sentential Decision Diagrams.
Proceedings of the TwentyFourth International Joint Conference on Artificial Intelligence, 2015
Tractable Learning for Structured Probability Spaces: A Case Study in Learning Preference Distributions.
Proceedings of the TwentyFourth International Joint Conference on Artificial Intelligence, 2015
Learning Bayesian Networks with NonDecomposable Scores.
Proceedings of the Graph Structures for Knowledge Representation and Reasoning, 2015
Probability Distributions over Structured Spaces.
Proceedings of the 2015 AAAI Spring Symposia, 2015
Value of Information Based on Decision Robustness.
Proceedings of the TwentyNinth AAAI Conference on Artificial Intelligence, 2015
On the Role of Canonicity in Knowledge Compilation.
Proceedings of the TwentyNinth AAAI Conference on Artificial Intelligence, 2015
2014
Algorithms and Applications for the SameDecision Probability.
J. Artif. Intell. Res., 2014
On the Role of Canonicity in Bottomup Knowledge Compilation.
CoRR, 2014
Decomposing Parameter Estimation Problems.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014
Probabilistic Sentential Decision Diagrams.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014
Skolemization for Weighted FirstOrder Model Counting.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, 2014
CVwidth: A New Complexity Parameter for CNFs.
Proceedings of the ECAI 2014  21st European Conference on Artificial Intelligence, 1822 August 2014, Prague, Czech Republic, 2014
On Compiling CNF into DecisionDNNF.
Proceedings of the Principles and Practice of Constraint Programming, 2014
Tractable Knowledge Representation Formalisms.
Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014
2013
Software health management with Bayesian networks.
ISSE, 2013
ObjectionBased Causal Networks
CoRR, 2013
Conditioning Methods for Exact and Approximate Inference in Causal Networks
CoRR, 2013
Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence (2002)
CoRR, 2013
EDML for Learning Parameters in Directed and Undirected Graphical Models.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 58, 2013
On the Complexity and Approximation of Binary Evidence in Lifted Inference.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 58, 2013
An Exact Algorithm for Computing the SameDecision Probability.
Proceedings of the IJCAI 2013, 2013
Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2013
Dynamic Minimization of Sentential Decision Diagrams.
Proceedings of the TwentySeventh AAAI Conference on Artificial Intelligence, 2013
2012
Samedecision probability: A confidence measure for thresholdbased decisions.
Int. J. Approx. Reason., 2012
New Advances and Theoretical Insights into EDML.
Proceedings of the TwentyEighth Conference on Uncertainty in Artificial Intelligence, 2012
Lifted Relax, Compensate and then Recover: From Approximate to Exact Lifted Probabilistic Inference.
Proceedings of the TwentyEighth Conference on Uncertainty in Artificial Intelligence, 2012
Generalized Decision Diagrams: The game is not over yet!
Proceedings of the ECAI 2012, 2012
Basing Decisions on Sentences in Decision Diagrams.
Proceedings of the TwentySixth AAAI Conference on Artificial Intelligence, 2012
2011
On the power of clauselearning SAT solvers as resolution engines.
Artif. Intell., 2011
EDML: A Method for Learning Parameters in Bayesian Networks.
Proceedings of the UAI 2011, 2011
SDD: A New Canonical Representation of Propositional Knowledge Bases.
Proceedings of the IJCAI 2011, 2011
2010
Probabilistic ModelBased Diagnosis: An Electrical Power System Case Study.
IEEE Trans. Syst. Man Cybern. Part A, 2010
On Modern ClauseLearning Satisfiability Solvers.
J. Autom. Reasoning, 2010
Bayesian networks.
Commun. ACM, 2010
Optimal algorithms for haplotype assembly from wholegenome sequence data.
Bioinformatics [ISMB], 2010
Towards software health management with bayesian networks.
Proceedings of the Workshop on Future of Software Engineering Research, 2010
Relax, Compensate and Then Recover.
Proceedings of the New Frontiers in Artificial Intelligence, 2010
Relax, Compensate and Then Recover: A Theory of Anytime, Approximate Inference.
Proceedings of the Logics in Artificial Intelligence  12th European Conference, 2010
On Decomposability and Interaction Functions.
Proceedings of the ECAI 2010, 2010
TopDown Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications.
Proceedings of the ECAI 2010, 2010
A Lower Bound on the Size of Decomposable Negation Normal Form.
Proceedings of the TwentyFourth AAAI Conference on Artificial Intelligence, 2010
2009
Complete Algorithms.
Proceedings of the Handbook of Satisfiability, 2009
WidthBased Restart Policies for ClauseLearning Satisfiability Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009
Approximating MAP by Compensating for Structural Relaxations.
Proceedings of the Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 710 December 2009, 2009
A New dDNNFBased Bound Computation Algorithm for Functional EMAJSAT.
Proceedings of the IJCAI 2009, 2009
On the Power of ClauseLearning SAT Solvers with Restarts.
Proceedings of the Principles and Practice of Constraint Programming, 2009
Approximating Weighted MaxSAT Problems by Compensating for Relaxations.
Proceedings of the Principles and Practice of Constraint Programming, 2009
Modeling and Reasoning with Bayesian Networks.
Cambridge University Press, ISBN: 9780521884389, 2009
2008
Bayesian Networks.
Proceedings of the Handbook of Knowledge Representation, 2008
Solving Weighted MaxSAT Problems in a Reduced Search Space: A Performance Analysis.
J. Satisf. Boolean Model. Comput., 2008
RC_Link: Genetic linkage analysis using Bayesian networks.
Int. J. Approx. Reason., 2008
On probabilistic inference by weighted model counting.
Artif. Intell., 2008
Efficient Genome Wide Tagging by Reduction to SAT.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008
Evaluating probabilistic reasoning systems.
Proceedings of the Sixth UAI Bayesian Modelling Applications Workshop Helsinki, 2008
Approximating the Partition Function by Deleting and then Correcting for Model Edges.
Proceedings of the UAI 2008, 2008
A New Clause Learning Scheme for Efficient Unsatisfiability Proofs.
Proceedings of the TwentyThird AAAI Conference on Artificial Intelligence, 2008
New Compilation Languages Based on Structured Decomposability.
Proceedings of the TwentyThird AAAI Conference on Artificial Intelligence, 2008
Diagnosing Faults in Electrical Power Systems of Spacecraft and Aircraft.
Proceedings of the TwentyThird AAAI Conference on Artificial Intelligence, 2008
ManyPairs Mutual Information for Adding Structure to Belief Propagation Approximations.
Proceedings of the TwentyThird AAAI Conference on Artificial Intelligence, 2008
Focusing Generalizations of Belief Propagation on Targeted Queries.
Proceedings of the TwentyThird AAAI Conference on Artificial Intelligence, 2008
2007
The Language of Search.
J. Artif. Intell. Res., 2007
Node Splitting: A Scheme for Generating Upper Bounds in Bayesian Networks.
Proceedings of the UAI 2007, 2007
A Lightweight Component Caching Scheme for Satisfiability Solvers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007
Compiling Bayesian Networks Using Variable Elimination.
Proceedings of the IJCAI 2007, 2007
Clone: Solving Weighted MaxSAT in a Reduced Search Space.
Proceedings of the AI 2007: Advances in Artificial Intelligence, 2007
2006
Compiling relational Bayesian networks for exact inference.
Int. J. Approx. Reason., 2006
A Variational Approach for Approximating Bayesian Networks by Edge Deletion.
Proceedings of the UAI '06, 2006
On the Robustness of Most Probable Explanations.
Proceedings of the UAI '06, 2006
Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006
Encoding CNFs to Empower Component Analysis.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006
Searching While Keeping a Trace: The Evolution from Satisfiability to Knowledge Compilation.
Proceedings of the Automated Reasoning, Third International Joint Conference, 2006
Solving MAP Exactly by Searching on Compiled Arithmetic Circuits.
Proceedings of the Proceedings, 2006
An Edge Deletion Semantics for Belief Propagation and its Practical Impact on Approximation Quality.
Proceedings of the Proceedings, 2006
2005
A distance measure for bounding probabilistic belief change.
Int. J. Approx. Reason., 2005
On the revision of probabilistic beliefs using uncertain evidence.
Artif. Intell., 2005
On Bayesian Network Approximation by Edge Deletion.
Proceedings of the UAI '05, 2005
Exploiting Evidence in Probabilistic Inference.
Proceedings of the UAI '05, 2005
DPLL with a Trace: From SAT to Knowledge Compilation.
Proceedings of the IJCAI05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
Compiling Bayesian Networks with Local Structure.
Proceedings of the IJCAI05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
Sensitivity Analysis in Markov Networks.
Proceedings of the IJCAI05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005
Pruning Conformant Plans by Counting Models on Compiled dDNNF Representations.
Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), 2005
On Compiling System Models for Faster and More Scalable Diagnosis.
Proceedings of the Proceedings, 2005
2004
Complexity Results and Approximation Strategies for MAP Explanations.
J. Artif. Intell. Res., 2004
A differential semantics for jointree algorithms.
Artif. Intell., 2004
Compiling propositional weighted bases.
Artif. Intell., 2004
Sensitivity Analysis in Bayesian Networks: From Single to Multiple Parameters.
Proceedings of the UAI '04, 2004
Using DPLL for Efficient OBDD Construction.
Proceedings of the SAT 2004, 2004
Toward Good Elimination Orders for Symbolic SAT Solving.
Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 2004
New Advances in Compiling CNF into Decomposable Negation Normal Form.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004
2003
A differential approach to inference in Bayesian networks.
J. ACM, 2003
Solving MAP Exactly using Systematic Search.
Proceedings of the UAI '03, 2003
Reasoning about Bayesian Network Classifiers.
Proceedings of the UAI '03, 2003
New Advances in Inference by Recursive Conditioning.
Proceedings of the UAI '03, 2003
A StructureBased Variable Ordering Heuristic for SAT.
Proceedings of the IJCAI03, 2003
Morphing the Hugin and ShenoyShafer Architectures.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2003
2002
A Knowledge Compilation Map.
J. Artif. Intell. Res., 2002
When do Numbers Really Matter?
J. Artif. Intell. Res., 2002
A Practical Relaxation of ConstantFactor Treewidth Approximation Algorithms.
Proceedings of the First European Workshop on Probabilistic Graphical Models, 68 November  2002, 2002
Optimal TimeSpace Tradeoff in Probabilistic Inference.
Proceedings of the First European Workshop on Probabilistic Graphical Models, 68 November  2002, 2002
Compilation of propositional weighted bases.
Proceedings of the 9th International Workshop on NonMonotonic Reasoning (NMR 2002), 2002
A Logical Approach to Factoring Belief Networks.
Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR02), 2002
A Compiler for Deterministic, Decomposable Negation Normal Form.
Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28, 2002
2001
On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision.
J. Appl. Non Class. Logics, 2001
Decomposable negation normal form.
J. ACM, 2001
Constantspace reasoning in dynamic Bayesian networks.
Int. J. Approx. Reason., 2001
Recursive conditioning.
Artif. Intell., 2001
Approximating MAP using Local Search.
Proceedings of the UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, 2001
A Perspective on Knowledge Compilation.
Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001
Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2001
2000
On the tractable counting of theory models and its application to belief revision and truth maintenance
CoRR, 2000
ModelBased Diagnosis under RealWorld Constraints.
AI Magazine, 2000
AnySpace Probabilistic Inference.
Proceedings of the UAI '00: Proceedings of the 16th Conference in Uncertainty in Artificial Intelligence, Stanford University, Stanford, California, USA, June 30, 2000
1999
Utilizing Device Behavior in StructureBased Diagnosis.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999
Compiling Knowledge into Decomposable Negation Normal Form.
Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 1999
1998
ModelBased Diagnosis using Structured System Descriptions.
J. Artif. Intell. Res., 1998
Dynamic Jointrees.
Proceedings of the UAI '98: Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, 1998
Compiling Devices: A StructureBased Approach.
Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998
1997
Query DAGs: A Practical Paradigm for Implementing BeliefNetwork Inference.
J. Artif. Intell. Res., 1997
On the Logic of Iterated Belief Revision.
Artif. Intell., 1997
A Logical Notion of Conditional Independence: Properties and Application.
Artif. Intell., 1997
A Standard Approach for Optimizing Belief Network Inference Using Query DAGs.
Proceedings of the UAI '97: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, 1997
The Effect of Observations on the Complexity of ModelBased Diagnosis.
Proceedings of the Fourteenth National Conference on Artificial Intelligence and Ninth Innovative Applications of Artificial Intelligence Conference, 1997
1996
Inference in belief networks: A procedural guide.
Int. J. Approx. Reason., 1996
Utilizing KnowledgeBase Semantics in GraphBased Algorithms.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996
1995
Conditioning Algorithms for Exact and Approximate Inference in Causal Networks.
Proceedings of the UAI '95: Proceedings of the Eleventh Annual Conference on Uncertainty in Artificial Intelligence, 1995
ModelBased Diagnosis using Causal Networks.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995
1994
On the Relation between Kappa Calculus and Probabilistic Reasoning.
Proceedings of the UAI '94: Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence, 1994
Action Networks: A Framework for Reasoning about Actions and Change under Uncertainty.
Proceedings of the UAI '94: Proceedings of the Tenth Annual Conference on Uncertainty in Artificial Intelligence, 1994
Symbolic Causal Networks.
Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, WA, USA, July 31, 1994
1993
Argument Calculus and Networks.
Proceedings of the UAI '93: Proceedings of the Ninth Annual Conference on Uncertainty in Artificial Intelligence, 1993
1992
Objectionbased Causal Exception Networks.
Proceedings of the UAI '92: Proceedings of the Eighth Annual Conference on Uncertainty in Artificial Intelligence, 1992
A Symbolic Generalization of Probability Theory.
Proceedings of the 10th National Conference on Artificial Intelligence, 1992
1988
OARPLAN: Generating project plans by reasoning about objects, actions and resources.
AI EDAM, 1988