Department of Computer Science
 

Reader

1 West 4.55

Dept of Computer Science

Email: a.guglielmi@bath.ac.uk

Tel: +44 (0) 1225 38 6274

 

Dr Alessio Guglielmi

Profile

Research Interests

I am interested in the foundations of computing, and especially in proof theory and proof complexity. Some of the most profound open problems in science belong to these fields, like P =? NP, coNP =? NP and the problem of determining whether two proofs or two algorithms are the same. My contribution is called deep inference: it is a relatively new research area that I founded, together with colleagues and students.

Please have a look at my research page for more details.

Publications

Aler Tubella, A., Guglielmi, A. and Ralph, B., 2017. Forthcoming. Removing Cycles from Proofs. In: 26th EACSL Annual Conference on Computer Science Logic 2017, 2017-08-20.

Guglielmi, A., Bruscoli, P., Gundersen, T. and Parigot, M., 2016. Quasipolynomial normalisation in deep inference via atomic flows and threshold formulae. Logical Methods in Computer Science, 12 (2), 5.

Guglielmi, A., 2015. Deep Inference. In: All About Proofs, Proofs for All. College Publications.

Blute, R., Guglielmi, A., Ivanov, I., Panangaden, P. and Stra├čburger, L., 2014. A Logical Basis for Quantum Evolution and Entanglement. In: Categories and Types in Logic, Language, and Physics.Vol. 8222. Springer, pp. 90-107.

Straburger, L. and Guglielmi, A., 2011. A system of interaction and structure IV: The exponentials and decomposition. ACM Transactions on Computational Logic, 12 (4), 23.

Guglielmi, A. and Straburger, L., 2011. A system of interaction and structure V: the exponentials and splitting. Mathematical Structures in Computer Science, 21 (3), pp. 563-584.

Guglielmi, A., Gundersen, T. and Straburger, L., 2010. Breaking paths in atomic flows for classical logic. In: 25th Annual IEEE Symposium on Logic in Computer Science, LICS 2010, July 11, 2010 - July 14, 2010, 2010-07-01. IEEE, pp. 284-293.

Guglielmi, A., Gundersen, T. and Parigot, M., 2010. A proof calculus which reduces syntactic bureaucracy. In: Proceedings of the 21st International Conference on Rewriting Techniques and Applications.Vol. 6. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 135-150.

Bruscoli, P., Guglielmi, A., Gundersen, T. and Parigot, M., 2010. A quasipolynomial cut-elimination procedure in deep inference via atomic flows and threshold formulae. Berlin: Springer, pp. 136-153.

Bruscoli, P. and Guglielmi, A., 2009. On the proof complexity of deep inference. ACM Transactions on Computational Logic, 10 (2), 14.

Guglielmi, A., 2009. Personal portrait of Giorgio Levi. Theoretical Computer Science, 410 (46), pp. 4605-4607.

Guglielmi, A. and Gundersen, T., 2008. Normalisation control in deep inference via atomic flows. Logical Methods in Computer Science, 4 (1), 9.

This list was generated on Mon Oct 23 16:16:23 2017 IST.

View more publications »