Ashish Sabharwal

Trans. Assoc. Comput. Linguistics, 2020

UnQovering Stereotyping Biases via Underspecified Questions.

[BibT_eX]

[DOI]

CoRR, 2020

Measuring and Reducing Non-Multifact Reasoning in Multi-hop Question Answering.

[BibT_eX]

[DOI]

Harsh Trivedi

CoRR, 2020

UnifiedQA: Crossing Format Boundaries With a Single QA System.

[BibT_eX]

[DOI]

CoRR, 2020

Natural Perturbation for Robust Question Answering.

[BibT_eX]

[DOI]

Daniel Khashabi

CoRR, 2020

From 'F' to 'A' on the N.Y. Regents Science Exams: An Overview of the Aristo Project.

[BibT_eX]

[DOI]

Sumithra Bhakthavatsalam

Dirk Groeneveld

Michal Guerquin

Michael Schmitz

AI Mag., 2020

Belief Propagation Neural Networks.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Adversarial Filters of Dataset Biases.

[BibT_eX]

[DOI]

Proceedings of the 37th International Conference on Machine Learning, 2020

Is Multihop QA in DiRe Condition? Measuring and Reducing Disconnected Reasoning.

[BibT_eX]

[DOI]

Harsh Trivedi

Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, 2020

UNQOVERing Stereotypical Biases via Underspecified Questions.

[BibT_eX]

[DOI]

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2020, 2020

UnifiedQA: Crossing Format Boundaries With a Single QA System.

[BibT_eX]

[DOI]

Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2020, 2020

More Bang for Your Buck: Natural Perturbation for Robust Question Answering.

[BibT_eX]

[DOI]

Daniel Khashabi

Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, 2020

A Simple Yet Strong Pipeline for HotpotQA.

[BibT_eX]

[DOI]

Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, 2020

Towards Efficient Discrete Integration via Adaptive Quantile Queries.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Not All Claims are Created Equal: Choosing the Right Statistical Approach to Assess Hypotheses.

[BibT_eX]

[DOI]

Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, 2020

Probing Natural Language Inference Models through Semantic Fragments.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

QASC: A Dataset for Question Answering via Sentence Composition.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

What Does My QA Model Know? Devising Controlled Probes using Expert Knowledge.

[BibT_eX]

[DOI]

Kyle Richardson

CoRR, 2019

Not All Claims are Created Equal: Choosing the Right Approach to Assess Your Hypotheses.

[BibT_eX]

[DOI]

CoRR, 2019

AdaWISH: Faster Discrete Integration via Adaptive Quantiles.

[BibT_eX]

[DOI]

CoRR, 2019

On the Capabilities and Limitations of Reasoning for Natural Language Understanding.

[BibT_eX]

[DOI]

CoRR, 2019

Adaptive Hashing for Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Approximating the Permanent by Sampling from Adaptive Partitions.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Repurposing Entailment for Multi-Hop Question Answering Tasks.

[BibT_eX]

[DOI]

Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 2019

What's Missing: A Knowledge Gap Guided Approach for Multi-hop Question Answering.

[BibT_eX]

[DOI]

Peter Clark

Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing, 2019

Exploiting Explicit Paths for Multi-hop Reading Comprehension.

[BibT_eX]

[DOI]

Proceedings of the 57th Conference of the Association for Computational Linguistics, 2019

QUAREL: A Dataset and Models for Answering Questions about Qualitative Relationships.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Knowledge Completion for Generics Using Guided Tensor Factorization.

[BibT_eX]

[DOI]

Hanie Sedghi

Trans. Assoc. Comput. Linguistics, 2018

Exploiting Explicit Paths for Multi-hop Reading Comprehension.

[BibT_eX]

[DOI]

Souvik Kundu

CoRR, 2018

Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challenge.

[BibT_eX]

[DOI]

CoRR, 2018

Adaptive Stratified Sampling for Precision-Recall Estimation.

[BibT_eX]

[DOI]

Yexiang Xue

Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018

Expanding Holographic Embeddings for Knowledge Completion.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answering.

[BibT_eX]

[DOI]

Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, October 31, 2018

Bridging Knowledge Gaps in Neural Entailment via Symbolic Models.

[BibT_eX]

[DOI]

Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, Brussels, Belgium, October 31, 2018

AdvEntuRe: Adversarial Training for Textual Entailment with Knowledge-Guided Examples.

[BibT_eX]

[DOI]

Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics, 2018

Approximate Inference via Weighted Rademacher Complexity.

[BibT_eX]

[DOI]

Jonathan Kuck

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

SciTaiL: A Textual Entailment Dataset from Science Question Answering.

[BibT_eX]

[DOI]

Peter Clark

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Question Answering as Global Reasoning Over Semantic Abstractions.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

How Good Are My Predictions? Efficiently Approximating Precision-Recall Curves for Massive Datasets.

[BibT_eX]

[DOI]

Hanie Sedghi

Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Learning What is Essential in Questions.

[BibT_eX]

[DOI]

Proceedings of the 21st Conference on Computational Natural Language Learning (CoNLL 2017), 2017

Answering Complex Questions Using Open Information Extraction.

[BibT_eX]

[DOI]

Peter Clark

Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, 2017

2016

Adaptive Concentration Inequalities for Sequential Decision Problems.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Question Answering via Integer Programming over Semi-Structured Knowledge.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Beyond Parity Constraints: Fourier Analysis of Hash Functions for Inference.

[BibT_eX]

[DOI]

Tudor Achim

Proceedings of the 33nd International Conference on Machine Learning, 2016

Closing the Gap Between Short and Long XORs for Model Counting.

[BibT_eX]

[DOI]

Shengjia Zhao

Sorathan Chaturapruek

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Selecting Near-Optimal Learners via Incremental Data Allocation.

[BibT_eX]

[DOI]

Gerald Tesauro

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Exact Sampling with Integer Linear Programs and Random Perturbations.

[BibT_eX]

[DOI]

Carolyn Kim

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Combining Retrieval, Statistics, and Inference to Answer Elementary Science Questions.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

DPLL: The Core of Modern Satisfiability Solvers.

[BibT_eX]

[DOI]

Donald W. Loveland

Proceedings of the Martin Davis on Computability, 2016

2015

Parsing Algebraic Word Problems into Equations.

[BibT_eX]

[DOI]

Rik Koncel-Kedziorski

Trans. Assoc. Comput. Linguistics, 2015

Markov Logic Networks for Natural Language Question Answering.

[BibT_eX]

[DOI]

CoRR, 2015

Exploring Markov Logic Networks for Question Answering.

[BibT_eX]

[DOI]

Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015

BDD-Guided Clause Generation.

[BibT_eX]

[DOI]

Brian Kell

Willem-Jan van Hoeve

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2015

2014

Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2014

Low-density Parity Constraints for Hashing-Based Discrete Integration.

[BibT_eX]

[DOI]

Proceedings of the 31th International Conference on Machine Learning, 2014

Parallel Combinatorial Optimization with Decision Diagrams.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Insights into Parallelism with Intensive Knowledge Sharing.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2014

Designing Fast Absorbing Markov Chains.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Non-Restarting SAT Solvers with Simple Preprocessing Can Efficiently Simulate Resolution.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013

Optimization With Parity Constraints: From Binary Codes to Discrete Integration.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Snappy: A Simple Algorithm Portfolio.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Embed and Project: Discrete Sampling with Universal Hashing.

[BibT_eX]

[DOI]

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 5-8, 2013

Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction.

[BibT_eX]

[DOI]

Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization.

[BibT_eX]

[DOI]

Proceedings of the 30th International Conference on Machine Learning, 2013

Stronger Inference through Implied Literals from Conflicts and Knapsack Covers.

[BibT_eX]

[DOI]

Tobias Achterberg

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Automated Design of Search with Composability.

[BibT_eX]

[DOI]

Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Large Landscape Conservation - Synthetic and Real-World Datasets.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012

Learning Back-Clauses in SAT - (Poster Presentation).

[BibT_eX]

[DOI]

Meinolf Sellmann

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Augmenting Clause Learning with Implied Literals - (Poster Presentation).

[BibT_eX]

[DOI]

Arie Matsliah

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation).

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Density Propagation and Improved Bounds on the Partition Function.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

Guiding Combinatorial Optimization with UCT.

[BibT_eX]

[DOI]

Chandra Reddy

Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Parallel SAT Solver Selection and Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2012

2011

Leveraging belief propagation, backtrack search, and statistics for model counting.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

S. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Third Edition.

[BibT_eX]

[DOI]

Artif. Intell., 2011

Non-Model-Based Algorithm Portfolios for SAT.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Accelerated Adaptive Markov Chain for Partition Function Computation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Constraint Reasoning and Kernel Clustering for Pattern Decomposition with Scaling.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

Algorithm Selection and Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT.

[BibT_eX]

[DOI]

Siddhartha Jain

Meinolf Sellmann

Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010

Floodlight illumination of infinite wedges.

[BibT_eX]

[DOI]

Comput. Geom., 2010

Predicting direct protein interactions from affinity purification mass spectrometry data.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2010

Reports of the AAAI 2010 Conference Workshops.

[BibT_eX]

[DOI]

AI Mag., 2010

Maximizing the Spread of Cascades Using Network Design.

[BibT_eX]

[DOI]

Proceedings of the UAI 2010, 2010

Understanding Sampling Style Adversarial Search Methods.

[BibT_eX]

[DOI]

Raghuram Ramanujan

Proceedings of the UAI 2010, 2010

An Empirical Study of Optimal Noise and Runtime Distributions in Local Search.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2010

An Empirical Study of Optimization for Maximizing Diffusion in Networks.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

On Adversarial Search Spaces and Sampling-Based Planning.

[BibT_eX]

[DOI]

Raghuram Ramanujan

Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

Preface.

[BibT_eX]

[DOI]

Gregory M. Provan

Proceedings of the Abstraction, 2010

Approximate Inference for Clusters in Solution Spaces.

[BibT_eX]

[DOI]

Proceedings of the Abstraction, 2010

2009

Incomplete Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Satisfiability, 2009

Model Counting.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Satisfiability, 2009

Exploiting Runtime Variation in Complete Solvers.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Satisfiability, 2009

Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings.

[BibT_eX]

[DOI]

Carmel Domshlak

Jörg Hoffmann

J. Artif. Intell. Res., 2009

SymChaff: exploiting symmetry in a structure-aware satisfiability solver.

[BibT_eX]

[DOI]

Constraints An Int. J., 2009

New filtering algorithms for combinations of among constraints.

[BibT_eX]

[DOI]

Gilles Pesant

Louis-Martin Rousseau

Constraints An Int. J., 2009

Relaxed DPLL Search for MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Backdoors in the Context of Learning.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Message-passing and local heuristics as decimation strategies for satisfiability.

[BibT_eX]

[DOI]

Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Backdoors to Combinatorial Optimization: Feasibility and Optimality.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

2008

Satisfiability Solvers.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Knowledge Representation, 2008

Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 21, 2008

Tradeoffs in Backdoors: Inconsistency Detection, Dynamic Simplification, and Preprocessing.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Filtering Atmost1 on Pairs of Set Variables.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Connections in Networks: A Hybrid Approach.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

2007

The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs.

[BibT_eX]

[DOI]

Russell Impagliazzo

Comput. Complex., 2007

Survey Propagation Revisited.

[BibT_eX]

[DOI]

Proceedings of the UAI 2007, 2007

Sampling and Soundness: Can We Have Both?

[BibT_eX]

[DOI]

Proceedings of the First International Workshop Workshop "New forms of reasoning for the Semantic Web: scalable, 2007

Short XORs for Model Counting: From Theory to Practice.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2007

From Sampling to Model Counting.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2007, 2007

Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics.

[BibT_eX]

[DOI]

Matthew Cary

Atri Rudra

Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Connections in Networks: Hardness of Feasibility Versus Optimality.

[BibT_eX]

[DOI]

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

Tradeoffs in the Complexity of Backdoor Detection.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2007

Counting CSP Solutions Using Generalized XOR Constraints.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

The Impact of Network Topology on Pure Nash Equilibria in Graphical Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 19, 2006

Revisiting the Sequence Constraint.

[BibT_eX]

[DOI]

Gilles Pesant

Louis-Martin Rousseau

Proceedings of the Principles and Practice of Constraint Programming, 2006

Friends or Foes? An AI Planning Perspective on Abstraction and Search.

[BibT_eX]

[DOI]

Jörg Hoffmann

Carmel Domshlak

Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Model Counting: A New Strategy for Obtaining Good Bounds.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2006

2005

Algorithmic applications of propositional proof complexity.

[BibT_eX]

[DOI]

PhD thesis, 2005

SymChaff: A Structure-Aware Satisfiability Solver.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 2005

2004

Towards Understanding and Harnessing the Potential of Clause Learning.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2004

2003

Using Problem Structure for Efficient Clause Learning.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Understanding the Power of Clause Learning.

[BibT_eX]

[DOI]

Proceedings of the IJCAI-03, 2003

2002

Bounded-depth Frege lower bounds for weaker pigeonhole principles

[BibT_eX]

[DOI]

Josh Buresh-Oppenheim

Electron. Colloquium Comput. Complex., 2002

2001

Resolution Complexity of Independent Sets in Random Graphs.

[BibT_eX]

[DOI]

Russell Impagliazzo