The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paolo Gentilini: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paola Forcheri, Paolo Gentilini, Maria Teresa Molfino
    Informational Logic for Automated Reasoning. [Citation Graph (0, 0)][DBLP]
    JELIA, 1996, pp:354-372 [Conf]
  2. Paola Forcheri, Paolo Gentilini, Maria Teresa Molfino
    Informational Logic in Knowledge Representation and Automated Deduction. [Citation Graph (0, 0)][DBLP]
    AI Commun., 1999, v:12, n:4, pp:185-208 [Journal]
  3. Paolo Gentilini
    Paraconsistent Arithmetic with a Local Consistency Operator and Global Selfreference. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:169, n:, pp:73-86 [Journal]
  4. Paola Forcheri, Paolo Gentilini
    Paraconsistent conjectural deduction based on logical entropy measures I: C-systems as non-standard inference framework. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2005, v:15, n:3, pp:285-319 [Journal]
  5. Paola Forcheri, Paolo Gentilini
    Paraconsistent Informational Logic. [Citation Graph (0, 0)][DBLP]
    J. Applied Logic, 2005, v:3, n:1, pp:97-118 [Journal]
  6. Paola Forcheri, Paolo Gentilini, Maria Teresa Molfino
    Informational Logic as a Tool for Automated Reasoning. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 1998, v:20, n:1, pp:167-190 [Journal]
  7. Paolo Gentilini
    Syntactical results on the arithmetical completeness of modal logic. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1993, v:52, n:4, pp:549-564 [Journal]
  8. Paolo Gentilini
    Proof-Theoretic Modal PA-Completeness I: A System-Sequent Metric. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:63, n:1, pp:27-48 [Journal]
  9. Paolo Gentilini
    Proof-Theoretic Modal PA-Completeness II: The Syntactic Countermodel. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:63, n:2, pp:245-268 [Journal]
  10. Paolo Gentilini
    Proof-Theoretic Modal PA-Completeness III: The Syntactic Proof. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:63, n:3, pp:301-310 [Journal]

Search in 0.003secs, Finished in 0.004secs
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