| 2017 | ICDT | How Many Variables Are Needed to Express an Existential Positive Query?. | Simone Bova, Hubie Chen |
| 2017 | LICS | Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queries. | Simone Bova, Fabio Mogavero |
| 2017 | PODS | Circuit Treewidth, Sentential Decision, and Query Compilation. | Simone Bova, Stefan Szeider |
| 2016 | AAAI | SDDs Are Exponentially More Succinct than OBDDs. | Simone Bova |
| 2016 | IJCAI | Knowledge Compilation Meets Communication Complexity. | Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky |
| 2015 | CSL | First-Order Queries on Finite Abelian Groups. | Simone Bova, Barnaby Martin |
| 2015 | CSR | On Compiling Structured CNFs to OBDDs. | Simone Bova, Friedrich Slivovsky |
| 2015 | SAT | On Compiling CNFs into Structured Deterministic DNNFs. | Simone Bova, Florent Capelli, Stefan Mengel, Friedrich Slivovsky |
| 2014 | CSL | Model checking existential logic on partially ordered sets. | Simone Bova, Robert Ganian, Stefan Szeider |
| 2014 | ICDT | The Complexity of Width Minimization for Existential Positive Queries. | Simone Bova, Hubie Chen |
| 2011 | ICALP | Generic Expression Hardness Results for Primitive Positive Formula Comparison. | Simone Bova, Hubie Chen, Matthew Valeriote |
| 2009 | ECSQARU | Soft Constraints Processing over Divisible Residuated Lattices. | Simone Bova |
| 2009 | LFCS | Applications of Finite Duality to Locally Finite Varieties of BL-Algebras. | Stefano Aguzzoli, Simone Bova, Vincenzo Marra |