Showing 1–20 of 89 results
/ Date/ Name
Apr 21, 2011Satisfiability of Acyclic and Almost Acyclic CNF FormulasJul 6, 2011Not So Easy Problems for Tree Decomposable GraphsMar 9, 2026Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial DesignMar 1, 2026LLM Self-Explanations Fail Semantic InvarianceOct 12, 2021A SAT Approach to Twin-WidthApr 14, 2011Backdoors to Tractable Answer-Set ProgrammingOct 29, 2013A Complete Parameterized Complexity Analysis of Bounded PlanningApr 10, 2018Parameterized Algorithms for the Matrix Completion ProblemAug 10, 2025CP-Agent: Agentic Constraint ProgrammingFeb 25, 2014The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract ArgumentationMar 7, 2013Meta-Kernelization with Structural ParametersFeb 1, 2026ASP-Bench: From Natural Language to Logic ProgramsApr 1, 2026Enumerating Two-Orbit GraphsJun 17, 2023Co-Certificate Learning with SAT Modulo SymmetriesApr 29, 2011Limits of PreprocessingApr 14, 2011Augmenting Tractable Fragments of Abstract ArgumentationApr 15, 2014Model Checking Existential Logic on Partially Ordered SetsAug 5, 2020A Time Leap Challenge for SAT SolvingNov 8, 2004Families of unsatisfiable k-CNF formulas with few occurrences per variableApr 19, 2013A SAT Approach to Clique-Width