The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Norihiro Kamide: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Norihiro Kamide
    Foundations of Paraconsistent Resolution. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:71, n:4, pp:419-441 [Journal]
  2. Norihiro Kamide
    Sequent Calculi for Intuitionistic Linear Logic with Strong Negation. [Citation Graph (0, 0)][DBLP]
    Logic Journal of the IGPL, 2002, v:10, n:6, pp:653-678 [Journal]
  3. Norihiro Kamide
    Natural deduction systems for Nelson's paraconsistent logic and its neighbors. [Citation Graph (0, 0)][DBLP]
    Journal of Applied Non-Classical Logics, 2005, v:15, n:4, pp:405-435 [Journal]
  4. Norihiro Kamide
    Substructural Logics with Mingle. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2002, v:11, n:2, pp:227-249 [Journal]
  5. Norihiro Kamide
    Kripke Semantics for Modal Substructural Logics. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2002, v:11, n:4, pp:453-470 [Journal]
  6. Norihiro Kamide
    Phase Semantics and Petri Net Interpretation for Resource-Sensitive Strong Negation. [Citation Graph (0, 0)][DBLP]
    Journal of Logic, Language and Information, 2006, v:15, n:4, pp:371-401 [Journal]
  7. Norihiro Kamide
    Relevance Principle for Substructural Logics with Mingle and Strong Negation. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2002, v:12, n:6, pp:913-928 [Journal]
  8. Norihiro Kamide
    Combining Soft Linear Logic and Spatio-temporal Operators. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2004, v:14, n:5, pp:625-650 [Journal]
  9. Norihiro Kamide
    Linear Logics with Communication-merge. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2005, v:15, n:1, pp:3-20 [Journal]
  10. Norihiro Kamide
    Classical linear logics with mix separation principle. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2003, v:49, n:2, pp:201-209 [Journal]
  11. Norihiro Kamide
    A note on dual-intuitionistic logic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2003, v:49, n:5, pp:519-524 [Journal]
  12. Norihiro Kamide
    On a logic of involutive quantales. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2005, v:51, n:6, pp:579-585 [Journal]
  13. Norihiro Kamide
    A spatial modal logic with a location interpretation. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2005, v:51, n:4, pp:331-341 [Journal]
  14. Norihiro Kamide
    Quantized Linear Logic, Involutive Quantales and Strong Negation. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2004, v:77, n:3, pp:355-384 [Journal]
  15. Norihiro Kamide
    Gentzen-Type Methods for Bilattice Negation. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 2005, v:80, n:2-3, pp:265-289 [Journal]
  16. Ryo Kashima, Norihiro Kamide
    Substructural Implicational Logics Including the Relevant Logic E. [Citation Graph (0, 0)][DBLP]
    Studia Logica, 1999, v:63, n:2, pp:181-212 [Journal]
  17. Norihiro Kamide
    Linear and affine logics with temporal, spatial and epistemic operators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:353, n:1-3, pp:165-207 [Journal]
  18. Norihiro Kamide
    A Canonical Model Construction for Substructural Logics with Strong Negation. [Citation Graph (0, 0)][DBLP]
    Reports on Mathematical Logic, 2002, v:36, n:, pp:95-116 [Journal]

  19. Extended Full Computation-Tree Logic with Sequence Modal Operator: Representing Hierarchical Tree Structures. [Citation Graph (, )][DBLP]


  20. Embedding Linear-Time Temporal Logic into Infinitary Logic: Application to Cut-Elimination for Multi-agent Infinitary Epistemic Linear-Time Temporal Logic. [Citation Graph (, )][DBLP]


  21. Linear Exponentials as Resource Operators: A Decidable First-order Linear Logic with Bounded Exponentials. [Citation Graph (, )][DBLP]


  22. Completeness for Generalized First-Order LTL. [Citation Graph (, )][DBLP]


  23. Branching-time Versus Linear-time - A Cooperative and Feasible Approach. [Citation Graph (, )][DBLP]


  24. Reasoning about Bounded Time Domain - An Alternative to NP-Complete Fragments of LTL. [Citation Graph (, )][DBLP]


  25. Paraconsistent Negation and Classical Negation in Computation Tree Logic. [Citation Graph (, )][DBLP]


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