maximum satisfiability

Globally Optimal Multi-Object Tracking with Splitting and Merging UAI 2026 Ordered Objectives in Maximum Satisfiability AAAI 2026 When Can We Learn from Noisy Logical Data? Parameterized Complexity of Approximate Concept Fitting in Description Logics UAI 2026 Parameterization of (Partial) Maximum Satisfiability above Matching in a Variable-Clause Graph AAAI 2024 Constraint Solving Approaches to the Business-to-Business Meeting Scheduling Problem (Extended Abstract) IJCAI 2023 Improved Algorithms for Maximum Satisfiability and Its Special Cases AAAI 2023 Unifying Core-Guided and Implicit Hitting Set Based Optimization IJCAI 2023 An Exact MaxSAT Algorithm: Further Observations and Further Improvements IJCAI 2022 Fine-grained Complexity of Partial Minimum Satisfiability IJCAI 2022 Large Neighbourhood Search for Anytime MaxSAT Solving IJCAI 2022 Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract) IJCAI 2021 New Length Dependent Algorithm for Maximum Satisfiability Problem AAAI 2021 Augmenting the Power of (Partial) MaxSat Resolution with Extension AAAI 2020 Deep Weighted MaxSAT for Aspect-based Opinion Extraction EMNLP 2020 Estimating the Density of States of Boolean Satisfiability Problems on Classical and Quantum Computing Platforms AAAI 2020 Extended Conjunctive Normal Form and An Efficient Algorithm for Cardinality Constraints IJCAI 2020 Generating Weighted MAX-2-SAT Instances with Frustrated Loops: an RBM Case Study JMLR 2020 Solving Set Cover and Dominating Set via Maximum Satisfiability AAAI 2020 Concurrency Debugging with MaxSMT AAAI 2019 Resolution and Domination: An Improved Exact MaxSAT Algorithm IJCAI 2019 Reduced Cost Fixing for Maximum Satisfiability IJCAI 2018 A Core-Guided Approach to Learning Optimal Causal Graphs IJCAI 2017 From Decimation to Local Search and Back: A New Approach to MaxSAT IJCAI 2017 Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability AISTATS 2014