Foundations

Epistemic Integrity Constraints for Ontology-Based Data Management AAAI 2020 Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms AAAI 2020 Euclidean Pathfinding with Compressed Path Databases IJCAI 2020 Exact yet Efficient Graph Parsing, Bi-directional Locality and the Constructivist Hypothesis ACL 2020 Explaining Naive Bayes and Other Linear Classifiers with Polynomial Time and Delay NeurIPS 2020 Explaining Propagators for String Edit Distance Constraints AAAI 2020 Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints IJCAI 2020 Facility Location Problem with Capacity Constraints: Algorithmic and Mechanism Design Perspectives AAAI 2020 Fair k-Centers via Maximum Matching ICML 2020 Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint NeurIPS 2020 Fast and Accurate Non-Projective Dependency Tree Linearization ACL 2020 Fast and Efficient Boolean Matrix Factorization by Geometric Segmentation AAAI 2020 Fast Differentiable Sorting and Ranking ICML 2020 Fast MSER CVPR 2020 Fast semantic parsing with well-typedness guarantees EMNLP 2020 Favorite-Candidate Voting for Eliminating the Least Popular Candidate in a Metric Space AAAI 2020 Finding Good Subtrees for Constraint Optimization Problems Using Frequent Pattern Mining AAAI 2020 Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes AAAI 2020 Flow-Based Network Creation Games IJCAI 2020 Formal Sanskrit Syntax: A Specification for Programming Language AACL 2020 FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints AAAI 2020 From tree matching to sparse graph alignment COLT 2020 gDLS*: Generalized Pose-and-Scale Estimation Given Scale and Gravity Priors CVPR 2020 Generalized Nonbacktracking Bounds on the Influence JMLR 2020 Generating Interactive Worlds with Text AAAI 2020