Intensional Negation in Constraint Logic Programs. - Paola Bruscoli; Francesca Levi; Giorgio Levi; Maria Chiara Meo (GULP, 1993)

Extensional and Intensional Sets in CLP with Intensional Negation. - Paola Bruscoli; Gianfranco Rossi; Agostino Dovier; Eugenio G. Omodeo; Enrico Pontelli (ICLP Workshop on Logic Programming with Sets, 1993)

Expressiveness of the Abstract Logic Programming Language Forum in Planning and Concurrency. - Paola Bruscoli; Alessio Guglielmi (GULP-PRODE (2), 1994)

Compilative Constructive Negation in Constraint Logic Programs. - Paola Bruscoli; Francesca Levi; Giorgio Levi; Maria Chiara Meo (CAAP, 1994)

Compiling Intensional Sets in CLP. - Paola Bruscoli; Agostino Dovier; Enrico Pontelli; Gianfranco Rossi (ICLP, 1994)

A Linear Logic Programming Language with Parallel and Sequential Conjunction. - Paola Bruscoli; Alessio Guglielmi (GULP-PRODE, 1995)

A Purely Logical Account of Sequentiality in Proof Search. - Paola Bruscoli (ICLP, 2002)

A Tutorial on Proof Theoretic Foundations of Logic Programming. - Paola Bruscoli; Alessio Guglielmi (ICLP, 2003)

On structuring proof search for first order linear logic. - Paola Bruscoli; Alessio Guglielmi (Theor. Comput. Sci., 2006)

On the proof complexity of deep inference. - Paola Bruscoli; Alessio Guglielmi (ACM Trans. Comput. Log., 2009)

A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae. - Paola Bruscoli; Alessio Guglielmi; Tom Gundersen; Michel Parigot (LPAR (Dakar), 2010)

Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae - Paola Bruscoli; Alessio Guglielmi; Tom Gundersen; Michel Parigot (Log. Methods Comput. Sci., 2016)

On the Length of Medial-Switch-Mix Derivations. - Paola Bruscoli; Lutz Straßburger (WoLLIC, 2017)