Discrete Mathematics

Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics AAAI 2021 Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components NeurIPS 2021 A SAT-based Resolution of Lam's Problem AAAI 2021 Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings AAAI 2021 Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up IJCAI 2021 Budget-Constrained Coalition Strategies with Discounting IJCAI 2021 Calculating the optimal step of arc-eager parsing for non-projective trees EACL 2021 Choice Logics and Their Computational Properties IJCAI 2021 Cluster Trellis: Data Structures & Algorithms for Exact Inference in Hierarchical Clustering AISTATS 2021 Compressing Exact Cover Problems with Zero-suppressed Binary Decision Diagrams IJCAI 2021 Computing Optimal Hypertree Decompositions with SAT IJCAI 2021 Computing Plan-Length Bounds Using Lengths of Longest Paths AAAI 2021 Decomposition-Guided Reductions for Argumentation and Treewidth IJCAI 2021 Decomposition Strategies to Count Integer Solutions over Linear Constraints IJCAI 2021 Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty AAAI 2021 Diversity in Kemeny Rank Aggregation: A Parameterized Approach IJCAI 2021 Efficient Message Passing for 0–1 ILPs with Binary Decision Diagrams ICML 2021 Epistemic Logic of Know-Who AAAI 2021 Fair Stable Matchings Under Correlated Preferences (Student Abstract) AAAI 2021 Fast Algorithms for Relational Marginal Polytopes IJCAI 2021 Finite-state Model of Shupamem Reduplication ACL 2021 Group testing for connected communities AISTATS 2021 How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements IJCAI 2021 Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach IJCAI 2021 Improved CP-Based Lagrangian Relaxation Approach with an Application to the TSP IJCAI 2021