 Characterizing Structural Hardness of Logic Programs: What makes Cycles
and Reachability Hard for Treewidth?AAAI Conference on Artificial Intelligence (AAAI), 2023 |
 Treewidth-aware Reductions of Normal ASP to SAT -- Is Normal ASP Harder
than SAT after All?Artificial Intelligence (AI), 2021 |
 Advanced Tools and Methods for Treewidth-Based Problem Solving --
Extended AbstractFrontiers in Artificial Intelligence and Applications (FAIA), 2022 |
 Are Hitting Formulas Hard for Resolution?Discrete Applied Mathematics (Discrete Appl. Math.), 2022 |
 Too much information: why CDCL solvers need to forget learned clausesPLoS ONE (PLoS ONE), 2022 |
 Bounds on the size of PC and URC formulasJournal of Artificial Intelligence Research (JAIR), 2020 |
 Local Consistency and SAT-SolversInternational Conference on Principles and Practice of Constraint Programming (CP), 2010 |
 |
 |
