| 2006 | CPAIOR | On the Separability of Subproblems in Benders Decompositions. | Marco Cadoli, Fabio Patrizi |
| 2006 | ECAI | Evaluating ASP and Commercial Solvers on the CSPLib. | Marco Cadoli, Toni Mancini, Davide Micaletto, Fabio Patrizi |
| 2006 | ISMIS | SAT as an Effective Solving Technology for Constraint Problems. | Marco Cadoli, Toni Mancini, Fabio Patrizi |
| 2005 | AAAI | CSP Properties for Quantified Constraints: Definitions and Complexity. | Lucas Bordeaux, Marco Cadoli, Toni Mancini |
| 2004 | JELIA | Exploiting Functional Dependencies in Declarative Problem Specifications. | Marco Cadoli, Toni Mancini |
| 2004 | KR | Automated Reformulation of Specifications by Safe Delay of Constraints. | Marco Cadoli, Toni Mancini |
| 2004 | LPAR | Exploiting Fixable, Removable, and Implied Values in Constraint Satisfaction Problems. | Lucas Bordeaux, Marco Cadoli, Toni Mancini |
| 2002 | PODS | Knowledge Compilation = Query Rewriting + View Synthesis. | Marco Cadoli, Toni Mancini |
| 2001 | CP | The Expressive Power of Binary Linear Programming. | Marco Cadoli |
| 2001 | ESOP | Compiling Problem Specifications into SAT. | Marco Cadoli, Andrea Schaerf |
| 2001 | IJCAI | Complexity of Nested Circumscription and Abnormality Theories. | Marco Cadoli, Thomas Eiter, Georg Gottlob |
| 1999 | LPNMR | Using LPNMR for Problem Specification and Code Generation. | Marco Cadoli |
| 1999 | PADL | NP-SPEC: An Executable Specification Language for Solving All Problems in NP. | Marco Cadoli, Luigi Palopoli, Andrea Schaerf, Domenico Vasile |
| 1998 | AAAI | An Algorithm to Evaluate Quantified Boolean Formulae. | Marco Cadoli, Andrea Giovanardi, Marco Schaerf |
| 1998 | JELIA | Propositional Lower Bounds: Generalization and Algorithms. | Marco Cadoli, Luigi Palopoli, Francesco Scarcello |
| 1996 | KR | Comparing Space Efficiency of Propositional Knowledge Representation Formalisms. | Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf |
| 1995 | PODS | The Size of a Revised Knowledge Base. | Marco Cadoli, Francesco M. Donini, Paolo Liberatore, Marco Schaerf |
| 1995 | STACS | On Compact Representations of Propositional Circumscription. | Marco Cadoli, Francesco M. Donini, Marco Schaerf |
| 1994 | AAAI | Is Intractability of Non-Monotonic Reasoning a Real Drawback? | Marco Cadoli, Francesco M. Donini, Marco Schaerf |
| 1994 | KR | Default Logic as a Query Language. | Marco Cadoli, Thomas Eiter, Georg Gottlob |
| 1993 | IJCAI | Semantical and Computational Aspects of Horn Approximations. | Marco Cadoli |
| 1992 | ECAI | Approximate Inference in Default Logic and Circumscription. | Marco Cadoli, Marco Schaerf |
| 1992 | KR | Approximation in Concept Description Languages. | Marco Cadoli, Marco Schaerf |
| 1992 | TARK | Approximate Reasoning and Non-Omniscient Agents. | Marco Cadoli, Marco Schaerf |
| 1990 | AAAI | The Complexity of Closed World Reasoning and Circumscription. | Marco Cadoli, Maurizio Lenzerini |