The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paola Bruscoli: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paola Bruscoli, Francesca Levi, Giorgio Levi, Maria Chiara Meo
    Intensional Negation in Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    GULP, 1993, pp:359-374 [Conf]
  2. Paola Bruscoli, Alessio Guglielmi
    Expressiveness of the Abstract Logic Programming Language Forum in Planning and Concurrency. [Citation Graph (0, 0)][DBLP]
    GULP-PRODE (2), 1994, pp:221-237 [Conf]
  3. Paola Bruscoli, Alessio Guglielmi
    A Linear Logic Programming Language with Parallel and Sequential Conjunction. [Citation Graph (0, 0)][DBLP]
    GULP-PRODE, 1995, pp:409-420 [Conf]
  4. Paola Bruscoli, Francesca Levi, Giorgio Levi, Maria Chiara Meo
    Compilative Constructive Negation in Constraint Logic Programs. [Citation Graph (0, 0)][DBLP]
    CAAP, 1994, pp:52-67 [Conf]
  5. Paola Bruscoli
    A Purely Logical Account of Sequentiality in Proof Search. [Citation Graph (0, 0)][DBLP]
    ICLP, 2002, pp:302-316 [Conf]
  6. Paola Bruscoli, Agostino Dovier, Enrico Pontelli, Gianfranco Rossi
    Compiling Intensional Sets in CLP. [Citation Graph (0, 0)][DBLP]
    ICLP, 1994, pp:647-661 [Conf]
  7. Paola Bruscoli, Alessio Guglielmi
    A Tutorial on Proof Theoretic Foundations of Logic Programming. [Citation Graph (0, 0)][DBLP]
    ICLP, 2003, pp:109-127 [Conf]
  8. Paola Bruscoli, Alessio Guglielmi
    On Structuring Proof Search for First Order Linear Logic. [Citation Graph (0, 0)][DBLP]
    LPAR, 2003, pp:389-406 [Conf]
  9. Paola Bruscoli, Alessio Guglielmi
    On Structuring Proof Search for First Order Linear Logic [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  10. Paola Bruscoli, Alessio Guglielmi
    On structuring proof search for first order linear logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:360, n:1-3, pp:42-76 [Journal]
  11. Paola Bruscoli, Alessio Guglielmi
    On the Proof Complexity of Deep Inference [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  12. Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002