Logic, Language, Information and Computation : 17th International Workshop, WoLLIC 2010, Brasilia, Brazil, July 6-9, 2010, Proceedings

by Dawar, Anuj; De Queiroz, Ruy

• ISBN13: 9783642138232
• ISBN10: 3642138233
• eBook ISBN(s): 9783642138249
• Format: Paperback
• Copyright: 2010-07-14
• Publisher: Springer Verlag
• More Book Details
• Purchase Benefits

Summary

This book is edited in collaboration with FoLLI, the Association of Logic, Language and Information. It constitutes the proceedings of the 17th International Workshop on Logic, Language, Information and Computation, WoLLIC 2010, held in Brasilia, Brazil, in July 2010. The book presents 7 invited talks together with 13 papers which were carefully reviewed and selected from 32 submissions. The papers cover some of the most active areas of research on the frontiers between computation, logic, and linguistics, with particular interest in cross-disciplinary topics. Typical areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection.

Table of Contents

Entailment Multipliers: An Algebraic Characterization of Validity for Classical and Modal Logics (Invited Talk)	p. 1
A CTL-Based Logic for Program Abstractions (Invited Talk)	p. 19
Application of Logic to Integer Sequences: A Survey (Invited Talk)	p. 34
The Two-Variable Fragment with Counting Revisited (Invited Talk)	p. 42
Intuitionistic Logic and Computability Theory (Invited Talk)	p. 55
Foundations of Satisfiability Modulo Theories (Invited Talk)	p. 58
Logical Form as a Determinant of Cognitive Processes	p. 59
Formal Lifetime Reliability Analysis Using Continuous Random Variables	p. 84
Modal Logics with Counting	p. 98
Verification of the Completeness of Unification Algorithms à la Robinson	p. 110
Mechanisation of PDA and Grammar Equivalence for Context-Free Languages	p. 125
On the Role of the Complementation Rule for Data Dependencies over Incomplete Relations	p. 136
Decidability and Undecidability Results on the Modal ¿-Calculus with a Natural Number-Valued Semantics	p. 148
Solving the Implication Problem for XML Functional Dependencies with Properties	p. 161
On Anaphora and the Binding Principles in Categorial Grammar	p. 176
Feasible Functions over Co-inductive Data	p. 191
Interval Valued Fuzzy Coimplication	p. 204
Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signatures	p. 218
Intersection Type Systems and Explicit Substitutions Calculi	p. 232
Generalising Conservativity	p. 247
Author Index	p. 259
Table of Contents provided by Ingram. All Rights Reserved.