default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPaola Bruscoli
Person information
- affiliation: University of Bath, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2016
[j3]Paola Bruscoli
, Alessio Guglielmi, Tom Gundersen, Michel Parigot:
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae. Log. Methods Comput. Sci. 12(2) (2016)- 2009
- [j2]Paola Bruscoli, Alessio Guglielmi:
On the proof complexity of deep inference. ACM Trans. Comput. Log. 10(2): 14:1-14:34 (2009) - 2006
- [j1]Paola Bruscoli, Alessio Guglielmi:
On structuring proof search for first order linear logic. Theor. Comput. Sci. 360(1-3): 42-76 (2006)
Conference and Workshop Papers
- 2017
- [c11]Paola Bruscoli, Lutz Straßburger:
On the Length of Medial-Switch-Mix Derivations. WoLLIC 2017: 68-79 - 2010
- [c10]Paola Bruscoli, Alessio Guglielmi, Tom Gundersen, Michel Parigot:
A Quasipolynomial Cut-Elimination Procedure in Deep Inference via Atomic Flows and Threshold Formulae. LPAR (Dakar) 2010: 136-153 - 2003
- [c9]Paola Bruscoli, Alessio Guglielmi:
A Tutorial on Proof Theoretic Foundations of Logic Programming. ICLP 2003: 109-127 - [c8]Paola Bruscoli, Alessio Guglielmi:
On Structuring Proof Search for First Order Linear Logic. LPAR 2003: 389-406 - 2002
- [c7]Paola Bruscoli:
A Purely Logical Account of Sequentiality in Proof Search. ICLP 2002: 302-316 - 1995
- [c6]Paola Bruscoli, Alessio Guglielmi:
A Linear Logic Programming Language with Parallel and Sequential Conjunction. GULP-PRODE 1995: 409-420 - 1994
- [c5]Paola Bruscoli, Alessio Guglielmi:
Expressiveness of the Abstract Logic Programming Language Forum in Planning and Concurrency. GULP-PRODE (2) 1994: 221-237 - [c4]Paola Bruscoli, Francesca Levi, Giorgio Levi, Maria Chiara Meo:
Compilative Constructive Negation in Constraint Logic Programs. CAAP 1994: 52-67 - [c3]Paola Bruscoli, Agostino Dovier, Enrico Pontelli, Gianfranco Rossi:
Compiling Intensional Sets in CLP. ICLP 1994: 647-661 - 1993
- [c2]Paola Bruscoli, Francesca Levi, Giorgio Levi, Maria Chiara Meo:
Intensional Negation in Constraint Logic Programs. GULP 1993: 359-374 - [c1]Paola Bruscoli, Gianfranco Rossi, Agostino Dovier, Eugenio G. Omodeo, Enrico Pontelli:
Extensional and Intensional Sets in CLP with Intensional Negation. ICLP Workshop on Logic Programming with Sets 1993
Informal and Other Publications
- 2007
- [i2]Paola Bruscoli, Alessio Guglielmi:
On the Proof Complexity of Deep Inference. CoRR abs/0709.1201 (2007) - 2003
- [i1]Paola Bruscoli, Alessio Guglielmi:
On Structuring Proof Search for First Order Linear Logic. CoRR cs.LO/0312002 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
