The SCEAS System
Navigation Menu

Conferences in DBLP

Logic in Computer Science (LICS) (lics)
2010 (conf/lics/2010)

  1. Querying the Guarded Fragment. [Citation Graph (, )][DBLP]

  2. Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment. [Citation Graph (, )][DBLP]

  3. Equality Is Typable in Semi-full Pure Type Systems. [Citation Graph (, )][DBLP]

  4. Strong Normalization for System F by HOAS on Top of FOAS. [Citation Graph (, )][DBLP]

  5. Game Semantics for a Polymorphic Programming Language. [Citation Graph (, )][DBLP]

  6. An Intuitionistic Logic that Proves Markov's Principle. [Citation Graph (, )][DBLP]

  7. Amir Pnueli: A Gentle Giant, Lord of the Phi's and the Psi's. [Citation Graph (, )][DBLP]

  8. Robin Milner, a Craftsman of Tools for the Mind. [Citation Graph (, )][DBLP]

  9. Alternating Timed Automata over Bounded Time. [Citation Graph (, )][DBLP]

  10. Regular Cost Functions over Finite Trees. [Citation Graph (, )][DBLP]

  11. Parikh Images of Grammars: Complexity and Applications. [Citation Graph (, )][DBLP]

  12. On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction. [Citation Graph (, )][DBLP]

  13. New Conditions for Taylor Varieties and CSP. [Citation Graph (, )][DBLP]

  14. The Fine Print of Security. [Citation Graph (, )][DBLP]

  15. Modular Construction of Fixed Point Combinators and Clocked Bohm Trees. [Citation Graph (, )][DBLP]

  16. Recursion Schemes and Logical Reflection. [Citation Graph (, )][DBLP]

  17. Undecidability of Propositional Separation Logic and Its Neighbours. [Citation Graph (, )][DBLP]

  18. The Undecidability of Boolean BI through Phase Semantics. [Citation Graph (, )][DBLP]

  19. Segal Condition Meets Computational Effects. [Citation Graph (, )][DBLP]

  20. The Isomorphism Problem on Classes of Automatic Structures. [Citation Graph (, )][DBLP]

  21. On the Strictness of the First-Order Quantifier Structure Hierarchy over Finite Structures. [Citation Graph (, )][DBLP]

  22. Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors. [Citation Graph (, )][DBLP]

  23. Lower Bounds for the Complexity of Monadic Second-Order Logic. [Citation Graph (, )][DBLP]

  24. Capturing Polynomial Time on Interval Graphs. [Citation Graph (, )][DBLP]

  25. A Generic Operational Metatheory for Algebraic Effects. [Citation Graph (, )][DBLP]

  26. Polarity and the Logic of Delimited Continuations. [Citation Graph (, )][DBLP]

  27. Datalog+/-: A Family of Logical Knowledge Representation and Query Languages for New Applications. [Citation Graph (, )][DBLP]

  28. An Extension of Data Automata that Captures XPath. [Citation Graph (, )][DBLP]

  29. Deciding Definability in FO2(<) (or XPath) on Trees. [Citation Graph (, )][DBLP]

  30. The Emptiness Problem for Tree Automata with Global Constraints. [Citation Graph (, )][DBLP]

  31. Addition-Invariant FO and Regularity. [Citation Graph (, )][DBLP]

  32. Theorem Proving for Verification: The Early Days. [Citation Graph (, )][DBLP]

  33. Breaking Paths in Atomic Flows for Classical Logic. [Citation Graph (, )][DBLP]

  34. Infinitary Completeness in Ludics. [Citation Graph (, )][DBLP]

  35. On Strong Maximality of Paraconsistent Finite-Valued Logics. [Citation Graph (, )][DBLP]

  36. Probabilistic Information Flow. [Citation Graph (, )][DBLP]

  37. Weak Equivalences in Psi-Calculi. [Citation Graph (, )][DBLP]

  38. A Calculus of Contracting Processes. [Citation Graph (, )][DBLP]

  39. On Probabilistic Automata in Continuous Time. [Citation Graph (, )][DBLP]

  40. omega-QRB-Domains and the Probabilistic Powerdomain. [Citation Graph (, )][DBLP]

  41. Abstracting the Differential Semantics of Rule-Based Models: Exact and Automated Model Reduction. [Citation Graph (, )][DBLP]

  42. The Expressive Power of Synchronizations. [Citation Graph (, )][DBLP]

  43. On the Expressivity of Symmetry in Event Structures. [Citation Graph (, )][DBLP]

  44. A Finiteness Structure on Resource Terms. [Citation Graph (, )][DBLP]

  45. Coalgebras, Chu Spaces, and Representations of Physical Systems. [Citation Graph (, )][DBLP]

  46. A Sound and Complete Calculus for Finite Stream Circuits. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002