Logic, Language, Information and Computation: 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA. Proceedings

✍ Scribed by Rajeev Alur (auth.), Lev D. Beklemishev, Ruy de Queiroz (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2011
• Tongue: English
• Leaves: 319
• Series: Lecture Notes in Computer Science 6642 Lecture Notes in Artificial Intelligence
• Edition: 1
• Category: Library

✦ Synopsis

This book constitutes the refereed proceedings of the 18th Workshop on Logic, Language, Information and Communication, WoLLIC 2011, held in Philadelphia, PA, USA, in May 2011. The 21 revised full papers presented were carefully reviewed and selected from 35 submissions. Among the topics covered are various aspects of mathematical logic, computer science logics, philosophical logics, such as complexity theory, model theory, partial order, Hoare logics, hybrid logics, Turing machines, etc.

✦ Table of Contents

Front Matter....Pages -
Streaming String Transducers....Pages 1-1
Unification in Logic....Pages 2-2
A Symbolic Logic with Exact Bounds for Cryptographic Protocols....Pages 3-3
Univalent Foundations of Mathematics....Pages 4-4
Relational Concepts and the Logic of Reciprocity....Pages 5-5
Logic in the Time of WWW: An OWL View....Pages 6-7
A Complexity Question in Justification Logic....Pages 8-19
Basic Model Theory for Memory Logics....Pages 20-34
Partial Realization in Dynamic Justification Logic....Pages 35-51
Hoare Logic for Higher Order Store Using Simple Semantics....Pages 52-66
Nominal Lawvere Theories....Pages 67-83
Turing Machines on Cayley Graphs....Pages 84-94
Information Flow on Directed Acyclic Graphs....Pages 95-109
The Boyce-Codd-Heath Normal Form for SQL....Pages 110-122
Hybrid Logics and NP Graph Properties....Pages 123-134
On the Expressive Power of IF-Logic with Classical Negation....Pages 135-145
Concurrent Logic Games on Partial Orders....Pages 146-160
Dynamic Epistemic Algebra with Post-conditions to Reason about Robot Navigation....Pages 161-175
Untestable Properties in the Kahr-Moore-Wang Class....Pages 176-186
Characterizing Definability of Second-Order Generalized Quantifiers....Pages 187-200
Countable Version of Omega-Rule....Pages 201-209
Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus....Pages 210-227
Strong Normalization and Confluence for Reflexive Combinatory Logic....Pages 228-238
On Polymorphic Types of Untyped Terms....Pages 239-256
Querying the Fragments of English....Pages 257-271
Strong Paraconsistency by Separating Composition and Decomposition in Classical Logic....Pages 272-292
How Much Expressive Power Is Needed for Natural Language Temporal Indexicality?....Pages 293-309
Back Matter....Pages -

✦ Subjects

Mathematical Logic and Formal Languages; Logics and Meanings of Programs; Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Discrete Mathematics in Computer Science; Symbolic and Algebraic Manipulation