18. WoLLIC 2011: Philadelphia, PA, USA

Invited Talks

• Rajeev Alur:
  Streaming String Transducers. 1
  
• Rosalie Iemhoff:
  Unification in Logic. 2
  
• John C. Mitchell:
  A Symbolic Logic with Exact Bounds for Cryptographic Protocols. 3
  
• Vladimir Voevodsky:
  Univalent Foundations of Mathematics. 4
  
• Yoad Winter:
  Relational Concepts and the Logic of Reciprocity. 5
  
• Michael Zakharyaschev:
  Logic in the Time of WWW: An OWL View. 6-7
  

Contributed Papers

• Antonis Achilleos:
  A Complexity Question in Justification Logic. 8-19
  
• Carlos Areces, Facundo Carreiro, Santiago Figueira, Sergio Mera:
  Basic Model Theory for Memory Logics. 20-34
  
• Samuel Bucheli, Roman Kuznets, Thomas Studer:
  Partial Realization in Dynamic Justification Logic. 35-51
  
• Nathaniel Charlton:
  Hoare Logic for Higher Order Store Using Simple Semantics. 52-66
  
• Ranald Clouston:
  Nominal Lawvere Theories. 67-83
  
• Aubrey da Cunha:
  Turing Machines on Cayley Graphs. 84-94
  
• Michael S. Donders, Sara Miner More, Pavel Naumov:
  Information Flow on Directed Acyclic Graphs. 95-109
  
• Flavio Ferrarotti, Sven Hartmann, Henning Köhler, Sebastian Link, Millist W. Vincent:
  The Boyce-Codd-Heath Normal Form for SQL. 110-122
  
• Francicleber Martins Ferreira, Cibele Matos Freire, Mario R. F. Benevides, L. Menasché Schechter, Ana Teresa C. Martins:
  Hybrid Logics and NP Graph Properties. 123-134
  
• Santiago Figueira, Daniel Gorín, Rafael Grimson:
  On the Expressive Power of IF-Logic with Classical Negation. 135-145
  
• Julian Gutierrez:
  Concurrent Logic Games on Partial Orders. 146-160
  
• Alexander Horn:
  Dynamic Epistemic Algebra with Post-conditions to Reason about Robot Navigation. 161-175
  
• Charles Jordan, Thomas Zeugmann:
  Untestable Properties in the Kahr-Moore-Wang Class. 176-186
  
• Juha Kontinen, Jakub Szymanik:
  Characterizing Definability of Second-Order Generalized Quantifiers. 187-200
  
• Grigori Mints:
  Countable Version of Omega-Rule. 201-209
  
• Paula Severi, Fer-Jan de Vries:
  Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus. 210-227
  
• Daniyar S. Shamkanov:
  Strong Normalization and Confluence for Reflexive Combinatory Logic. 228-238
  
• Rick Statman:
  On Polymorphic Types of Untyped Terms. 239-256
  
• Camilo Thorne:
  Querying the Fragments of English. 257-271
  
• Peter Verdée:
  Strong Paraconsistency by Separating Composition and Decomposition in Classical Logic. 272-292
  
• Igor Yanovich:
  How Much Expressive Power Is Needed for Natural Language Temporal Indexicality? 293-309
  

Last update Fri May 25 08:49:41 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page