The SCEAS System
Navigation Menu

Conferences in DBLP

Birthday ... (birthday)
2005 (conf/birthday/2005gabbay1)

  1. Samson Abramsky
    A Cook's Tour of the Finitary Non-Well-Founded Sets. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:1-18 [Conf]
  2. Sergei N. Artëmov
    Existential Semantics for Modal Logic. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:19-30 [Conf]
  3. David Ahn, Sisay Fissaha Adafre, Maarten de Rijke
    Recognizing and Interpreting Temporal Expressions in Open Domain Texts. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:31-50 [Conf]
  4. Atocha Aliseda
    What is a Logical System? A Commentary. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:51-56 [Conf]
  5. Amihood Amir
    Two Glass Balls and a Tower. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:57-76 [Conf]
  6. Carlos Areces, Patrick Blackburn
    Reichenbach, Prior and Montague: A Semantic Get-together. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:77-88 [Conf]
  7. Wouter van Atteveldt, Stefan Schlobach
    A Modal View on Polder Politics. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:89-104 [Conf]
  8. Arnon Avron
    Logical Non-determinism as a Tool for Logical Modularity: An Introduction. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:105-124 [Conf]
  9. Matthias Baaz, Rosalie Iemhoff
    On the Proof Theory of the Existence Predicate. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:125-166 [Conf]
  10. Sebastian Bader, Pascal Hitzler
    Dimensions of Neural-symbolic Integration - A Structured Survey. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:167-194 [Conf]
  11. Howard Barringer, David E. Rydeheard
    Modelling Evolvable Systems: A Temporal Logic View. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:195-228 [Conf]
  12. Johan van Benthem
    Open Problems in Logic and Games. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:229-264 [Conf]
  13. Alexander Bochman
    Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:265-308 [Conf]
  14. Krysia Broda, Alessandra Russo
    Compiled Labelled Deductive Systems for Access Control. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:309-338 [Conf]
  15. Peter Bruza, Richard J. Cole
    Quantum Logic of Semantic Space: An Exploratory Investigation of Context Effects in Practical Reasoning. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:339-362 [Conf]
  16. Carlos Caleiro, Amílcar Sernadas, Cristina Sernadas
    Fibring Logics: Past, Present and Future. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:363-388 [Conf]
  17. Walter Alexandre Carnielli, Marcelo E. Coniglio
    Splitting Logics. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:389-414 [Conf]
  18. Ariel Cohen, Michael Kaminski, Johann A. Makowsky
    Indistinguishability by Default. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:415-428 [Conf]
  19. Marcello D'Agostino
    Classical Natural Deduction. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:429-468 [Conf]
  20. Artur S. d'Avila Garcez, Luís C. Lamb
    Neural-Symbolic Systems and the Case for Non-Classical Reasoning. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:469-488 [Conf]
  21. Anuj Dawar
    How Many First-order Variables are Needed on Finite Ordered Structures? [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:489-520 [Conf]
  22. Jürgen Dix, Ugur Kuter, Dana S. Nau
    Planning in Answer Set Programming using Ordered Task Decomposition. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:521-576 [Conf]
  23. Kosta Dosen, Zoran Petric
    Negation and Involutive Adjunctions. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:577-586 [Conf]
  24. Luis Fariñas del Cerro, Olivier Gasquet, Andreas Herzig, Mohamad Sahade
    Modal Tableaux: Completeness vs. Termination. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:587-614 [Conf]
  25. Paolo Ferraris, Vladimir Lifschitz
    Mathematical Foundations of Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:615-664 [Conf]
  26. Melvin Fitting
    A Mistake on My Part. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:665-670 [Conf]
  27. Marcelo Finger
    DAG Sequents with Substitution. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:671-686 [Conf]
  28. Chris Fox, Shalom Lappin
    Polymorphic Quantifiers and Underspecification in Natural Language. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:687-700 [Conf]
  29. Michael Gabbay, Murdoch Gabbay
    Some Formal Considerations on Gabbay's Restart Rule in Natural Deduction and Goal-Directed Reasoning. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:701-730 [Conf]
  30. Murdoch Gabbay, Michael Gabbay
    a-logic. [Citation Graph (0, 0)][DBLP]
    We Will Show Them! (1), 2005, pp:731-764 [Conf]
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