sat solving

Stable Voting and the Splitting of Cycles AAAI 2026 Breaking Symmetries in Quantified Graph Search: A Comparative Study AAAI 2025 Complete Symmetry Breaking for Finite Models AAAI 2025 Learning Splitting Heuristics in Divide-and-Conquer SAT Solvers with Reinforcement Learning ICLR 2025 TRACE-CS: A Synergistic Approach to Explainable Course Scheduling Using LLMs and Logic AAAI 2025 NeuroBack: Improving CDCL SAT Solving using Graph Neural Networks ICLR 2024 SAT-Based Tree Decomposition with Iterative Cascading Policy Selection AAAI 2024 Symbolic Reasoning Methods for AI Planning AAAI 2024 Probabilistic Generalization of Backdoor Trees with Application to SAT AAAI 2023 The Multi-Agent Transportation Problem AAAI 2023 Certified Symmetry and Dominance Breaking for Combinatorial Optimisation AAAI 2022 Displaying Justifications for Collective Decisions IJCAI 2022 Faster Algorithms for Weak Backdoors AAAI 2022 Problem Compilation for Multi-Agent Path Finding: a Survey IJCAI 2022 QCDCL with Cube Learning or Pure Literal Elimination - What is Best? IJCAI 2022 A Scalable Two Stage Approach to Computing Optimal Decision Sets AAAI 2021 A Sharp Leap from Quantified Boolean Formula to Stochastic Boolean Satisfiability Solving AAAI 2021 Learning CNF Theories Using MDL and Predicate Invention IJCAI 2021 Analysis of One-to-One Matching Mechanisms via SAT Solving: Impossibilities for Universal Axioms AAAI 2020 Guiding CDCL SAT Search via Random Exploration amid Conflict Depression AAAI 2020 Solving Sum-of-Costs Multi-Agent Pathfinding with Answer-Set Programming AAAI 2020 Finding Optimal Solutions in HTN Planning - A SAT-based Approach IJCAI 2019 SAT-Based Explicit LTLf Satisfiability Checking AAAI 2019 Novel Algorithms for Abstract Dialectical Frameworks based on Complexity Analysis of Subclasses and SAT Solving IJCAI 2018 Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? IJCAI 2017