The SCEAS System
Navigation Menu

Conferences in DBLP

Conference for Computer Science Logic (CSL) (csl)
2010 (conf/csl/2010)

  1. Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries. [Citation Graph (, )][DBLP]

  2. Definability in Games. [Citation Graph (, )][DBLP]

  3. From Feasible Proofs to Feasible Computations. [Citation Graph (, )][DBLP]

  4. Tree Dualities for Constraint Satisfaction. [Citation Graph (, )][DBLP]

  5. Ordered Sets in the Calculus of Data Structures. [Citation Graph (, )][DBLP]

  6. Abductive, Inductive and Deductive Reasoning about Resources. [Citation Graph (, )][DBLP]

  7. Constraint Solving for Program Verification: Theory and Practice by Example. [Citation Graph (, )][DBLP]

  8. Tableau Calculi for CSL\mathcal{CSL} over minspaces. [Citation Graph (, )][DBLP]

  9. A Resolution Mechanism for Prenex Gödel Logic. [Citation Graph (, )][DBLP]

  10. Efficient Enumeration for Conjunctive Queries over X-underbar Structures. [Citation Graph (, )][DBLP]

  11. A Formalisation of the Normal Forms of Context-Free Grammars in HOL4. [Citation Graph (, )][DBLP]

  12. Automata vs. Logics on Data Words. [Citation Graph (, )][DBLP]

  13. Graded Computation Tree Logic with Binary Coding. [Citation Graph (, )][DBLP]

  14. Exact Exploration and Hanging Algorithms. [Citation Graph (, )][DBLP]

  15. Embedding Deduction Modulo into a Prover. [Citation Graph (, )][DBLP]

  16. Exponentials with Infinite Multiplicities. [Citation Graph (, )][DBLP]

  17. Classical and Intuitionistic Subexponential Logics Are Equally Expressive. [Citation Graph (, )][DBLP]

  18. On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT. [Citation Graph (, )][DBLP]

  19. A Logic of Sequentiality. [Citation Graph (, )][DBLP]

  20. Environment and Classical Channels in Categorical Quantum Mechanics. [Citation Graph (, )][DBLP]

  21. Formal Theories for Linear Algebra. [Citation Graph (, )][DBLP]

  22. Energy and Mean-Payoff Games with Imperfect Information. [Citation Graph (, )][DBLP]

  23. Randomisation and Derandomisation in Descriptive Complexity Theory. [Citation Graph (, )][DBLP]

  24. Towards a Canonical Classical Natural Deduction System. [Citation Graph (, )][DBLP]

  25. Coordination Logic. [Citation Graph (, )][DBLP]

  26. Second-Order Equational Logic (Extended Abstract). [Citation Graph (, )][DBLP]

  27. Fibrational Induction Rules for Initial Algebras. [Citation Graph (, )][DBLP]

  28. A Sequent Calculus with Implicit Term Representation. [Citation Graph (, )][DBLP]

  29. New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures. [Citation Graph (, )][DBLP]

  30. The Structural lambda-Calculus. [Citation Graph (, )][DBLP]

  31. The Isomorphism Problem for omega-Automatic Trees. [Citation Graph (, )][DBLP]

  32. Complexity Results for Modal Dependence Logic. [Citation Graph (, )][DBLP]

  33. The Complexity of Positive First-Order Logic without Equality II: The Four-Element Case. [Citation Graph (, )][DBLP]

  34. On the Computability of Region-Based Euclidean Logics. [Citation Graph (, )][DBLP]

  35. Inductive-Inductive Definitions. [Citation Graph (, )][DBLP]

  36. Quantified Differential Dynamic Logic for Distributed Hybrid Systems. [Citation Graph (, )][DBLP]

  37. Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic. [Citation Graph (, )][DBLP]

  38. Two-Variable Logic with Two Order Relations - (Extended Abstract). [Citation Graph (, )][DBLP]

  39. Signature Extensions Preserve Termination - An Alternative Proof via Dependency Pairs. [Citation Graph (, )][DBLP]

  40. Coq Modulo Theory. [Citation Graph (, )][DBLP]

  41. The Ackermann Award 2010. [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