Ashish Sabharwal

According to our database1, Ashish Sabharwal authored at least 115 papers between 2001 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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

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

QASC: A Dataset for Question Answering via Sentence Composition.
CoRR, 2019

AdaWISH: Faster Discrete Integration via Adaptive Quantiles.
CoRR, 2019

Probing Natural Language Inference Models through Semantic Fragments.
CoRR, 2019

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

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

Adaptive Hashing for Model Counting.
Proceedings of the Thirty-Fifth Conference on Uncertainty in Artificial Intelligence, 2019

Approximating the Permanent by Sampling from Adaptive Partitions.
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.
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.
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.
Proceedings of the 57th Conference of the Association for Computational Linguistics, 2019

QUAREL: A Dataset and Models for Answering Questions about Qualitative Relationships.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Knowledge Completion for Generics Using Guided Tensor Factorization.
TACL, 2018

Exploiting Explicit Paths for Multi-hop Reading Comprehension.
CoRR, 2018

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

Adaptive Stratified Sampling for Precision-Recall Estimation.
Proceedings of the Thirty-Fourth Conference on Uncertainty in Artificial Intelligence, 2018

Expanding Holographic Embeddings for Knowledge Completion.
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.
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.
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.
Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics, 2018

Approximate Inference via Weighted Rademacher Complexity.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

SciTaiL: A Textual Entailment Dataset from Science Question Answering.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Question Answering as Global Reasoning Over Semantic Abstractions.
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.
Proceedings of the Thirty-Third Conference on Uncertainty in Artificial Intelligence, 2017

Learning What is Essential in Questions.
Proceedings of the 21st Conference on Computational Natural Language Learning (CoNLL 2017), 2017

Answering Complex Questions Using Open Information Extraction.
Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, 2017

2016
Adaptive Concentration Inequalities for Sequential Decision Problems.
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.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Beyond Parity Constraints: Fourier Analysis of Hash Functions for Inference.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Closing the Gap Between Short and Long XORs for Model Counting.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Selecting Near-Optimal Learners via Incremental Data Allocation.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Exact Sampling with Integer Linear Programs and Random Perturbations.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Combining Retrieval, Statistics, and Inference to Answer Elementary Science Questions.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

DPLL: The Core of Modern Satisfiability Solvers.
Proceedings of the Martin Davis on Computability, 2016

2015
Parsing Algebraic Word Problems into Equations.
TACL, 2015

Markov Logic Networks for Natural Language Question Answering.
CoRR, 2015

Exploring Markov Logic Networks for Question Answering.
Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015

BDD-Guided Clause Generation.
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.
Ann. Math. Artif. Intell., 2014

Low-density Parity Constraints for Hashing-Based Discrete Integration.
Proceedings of the 31th International Conference on Machine Learning, 2014

Parallel Combinatorial Optimization with Decision Diagrams.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Insights into Parallelism with Intensive Knowledge Sharing.
Proceedings of the Principles and Practice of Constraint Programming, 2014

Designing Fast Absorbing Markov Chains.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

Non-Restarting SAT Solvers with Simple Preprocessing Can Efficiently Simulate Resolution.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Optimization With Parity Constraints: From Binary Codes to Discrete Integration.
Proceedings of the Twenty-Ninth Conference on Uncertainty in Artificial Intelligence, 2013

Snappy: A Simple Algorithm Portfolio.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Embed and Project: Discrete Sampling with Universal Hashing.
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.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering.
Proceedings of the IJCAI 2013, 2013

Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization.
Proceedings of the 30th International Conference on Machine Learning, 2013

Stronger Inference through Implied Literals from Conflicts and Knapsack Covers.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

Automated Design of Search with Composability.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

Resolution and Parallelizability: Barriers to the Efficient Parallelization of SAT Solvers.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

Large Landscape Conservation - Synthetic and Real-World Datasets.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Learning Back-Clauses in SAT - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Augmenting Clause Learning with Implied Literals - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

SatX10: A Scalable Plug&Play Parallel SAT Framework - (Tool Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Density Propagation and Improved Bounds on the Partition Function.
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.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Parallel SAT Solver Selection and Scheduling.
Proceedings of the Principles and Practice of Constraint Programming, 2012

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

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

Non-Model-Based Algorithm Portfolios for SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Accelerated Adaptive Markov Chain for Partition Function Computation.
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.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

Algorithm Selection and Scheduling.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Floodlight illumination of infinite wedges.
Comput. Geom., 2010

Predicting direct protein interactions from affinity purification mass spectrometry data.
Algorithms for Molecular Biology, 2010

Reports of the AAAI 2010 Conference Workshops.
AI Magazine, 2010

Maximizing the Spread of Cascades Using Network Design.
Proceedings of the UAI 2010, 2010

Understanding Sampling Style Adversarial Search Methods.
Proceedings of the UAI 2010, 2010

An Empirical Study of Optimal Noise and Runtime Distributions in Local Search.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

An Empirical Study of Optimization for Maximizing Diffusion in Networks.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

On Adversarial Search Spaces and Sampling-Based Planning.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

Preface.
Proceedings of the Abstraction, 2010

Approximate Inference for Clusters in Solution Spaces.
Proceedings of the Abstraction, 2010

2009
Incomplete Algorithms.
Proceedings of the Handbook of Satisfiability, 2009

Model Counting.
Proceedings of the Handbook of Satisfiability, 2009

Exploiting Runtime Variation in Complete Solvers.
Proceedings of the Handbook of Satisfiability, 2009

Friends or Foes? On Planning as Satisfiability and Abstract CNF Encodings.
J. Artif. Intell. Res., 2009

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

New filtering algorithms for combinations of among constraints.
Constraints, 2009

Relaxed DPLL Search for MaxSAT.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Backdoors in the Context of Learning.
Proceedings of the Theory and Applications of Satisfiability Testing, 2009

Message-passing and local heuristics as decimation strategies for satisfiability.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

Integrating Systematic and Local Search Paradigms: A New Strategy for MaxSAT.
Proceedings of the IJCAI 2009, 2009

Backdoors to Combinatorial Optimization: Feasibility and Optimality.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

2008
Satisfiability Solvers.
Proceedings of the Handbook of Knowledge Representation, 2008

Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation.
Proceedings of the Advances in Neural Information Processing Systems 21, 2008

Tradeoffs in Backdoors: Inconsistency Detection, Dynamic Simplification, and Preprocessing.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Filtering Atmost1 on Pairs of Set Variables.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Connections in Networks: A Hybrid Approach.
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.
Computational Complexity, 2007

Survey Propagation Revisited.
Proceedings of the UAI 2007, 2007

Sampling and Soundness: Can We Have Both?
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.
Proceedings of the Theory and Applications of Satisfiability Testing, 2007

From Sampling to Model Counting.
Proceedings of the IJCAI 2007, 2007

Paper Retraction: On the Hardness of Embeddings Between Two Finite Metrics.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

Connections in Networks: Hardness of Feasibility Versus Optimality.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

Tradeoffs in the Complexity of Backdoor Detection.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Counting CSP Solutions Using Generalized XOR Constraints.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

The Impact of Network Topology on Pure Nash Equilibria in Graphical Games.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency.
Proceedings of the Theory and Applications of Satisfiability Testing, 2006

Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints.
Proceedings of the Advances in Neural Information Processing Systems 19, 2006

Revisiting the Sequence Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2006

Friends or Foes? An AI Planning Perspective on Abstraction and Search.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

Model Counting: A New Strategy for Obtaining Good Bounds.
Proceedings of the Proceedings, 2006

2005
SymChaff: A Structure-Aware Satisfiability Solver.
Proceedings of the Proceedings, 2005

2004
Towards Understanding and Harnessing the Potential of Clause Learning.
J. Artif. Intell. Res., 2004

2003
Using Problem Structure for Efficient Clause Learning.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Understanding the Power of Clause Learning.
Proceedings of the IJCAI-03, 2003

2002
Bounded-depth Frege lower bounds for weaker pigeonhole principles
Electronic Colloquium on Computational Complexity (ECCC), 2002

2001
Resolution Complexity of Independent Sets in Random Graphs.
Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001


  Loading...