2009 |
13 | EE | Paola Bruscoli,
Alessio Guglielmi:
On the proof complexity of deep inference.
ACM Trans. Comput. Log. 10(2): (2009) |
12 | EE | Paola Bruscoli,
Alessio Guglielmi,
Tom Gundersen,
Michel Parigot:
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae
CoRR abs/0903.5392: (2009) |
2007 |
11 | EE | Paola Bruscoli,
Alessio Guglielmi:
On the Proof Complexity of Deep Inference
CoRR abs/0709.1201: (2007) |
2006 |
10 | EE | Paola Bruscoli,
Alessio Guglielmi:
On structuring proof search for first order linear logic.
Theor. Comput. Sci. 360(1-3): 42-76 (2006) |
2003 |
9 | EE | Paola Bruscoli,
Alessio Guglielmi:
A Tutorial on Proof Theoretic Foundations of Logic Programming.
ICLP 2003: 109-127 |
8 | EE | Paola Bruscoli,
Alessio Guglielmi:
On Structuring Proof Search for First Order Linear Logic.
LPAR 2003: 389-406 |
7 | EE | Paola Bruscoli,
Alessio Guglielmi:
On Structuring Proof Search for First Order Linear Logic
CoRR cs.LO/0312002: (2003) |
2002 |
6 | EE | Paola Bruscoli:
A Purely Logical Account of Sequentiality in Proof Search.
ICLP 2002: 302-316 |
1995 |
5 | | Paola Bruscoli,
Alessio Guglielmi:
A Linear Logic Programming Language with Parallel and Sequential Conjunction.
GULP-PRODE 1995: 409-420 |
1994 |
4 | | Paola Bruscoli,
Francesca Levi,
Giorgio Levi,
Maria Chiara Meo:
Compilative Constructive Negation in Constraint Logic Programs.
CAAP 1994: 52-67 |
3 | | Paola Bruscoli,
Alessio Guglielmi:
Expressiveness of the Abstract Logic Programming Language Forum in Planning and Concurrency.
GULP-PRODE (2) 1994: 221-237 |
2 | | Paola Bruscoli,
Agostino Dovier,
Enrico Pontelli,
Gianfranco Rossi:
Compiling Intensional Sets in CLP.
ICLP 1994: 647-661 |
1993 |
1 | | Paola Bruscoli,
Francesca Levi,
Giorgio Levi,
Maria Chiara Meo:
Intensional Negation in Constraint Logic Programs.
GULP 1993: 359-374 |