Logic, Language, Information and Computation : 15th International Workshop, WoLLIC 2008 Edinburgh, UK, July 1-4, 2008, Proceedings

by Hodges, Wilfrid; Queiroz, Ruy De

• ISBN13: 9783540699361
• ISBN10: 3540699368
• Format: Paperback
• Copyright: 2008-08-03
• Publisher: Springer-Verlag New York Inc

Summary

Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the 4th volume of the FoLLI LNAI subline; containing the refereed proceedings of the 15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008, held in Edinburgh, UK, in July 2008.The 21 revised full papers presented together with the abstracts of 7 tutorials and invited lectures were carefully reviewed and selected from numerous submissions. The papers cover all pertinent subjects in computer science 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

Inter-deriving Semantic Artifacts for Object-Oriented Programming	p. 1
On the Descriptive Complexity of Linear Algebra	p. 17
Talks on Quantum Computing	p. 26
On Game Semantics of the Affine and Intuitionistic Logics	p. 28
The Grammar of Scope	p. 43
Conjunctive Grammars and Alternating Pushdown Automata	p. 44
Expressive Power and Decidability for Memory Logics	p. 56
Reasoning with Uncertainty by Nmatrix-Metric Semantics	p. 69
A Propositional Dynamic Logic for CCS Programs	p. 83
Towards Ontology Evolution in Physics	p. 98
Nominal Matching and Alpha-Equivalence (Extended Abstract)	p. 111
Interval Additive Generators of Interval T-Norms	p. 123
Propositional Dynamic Logic as a Logic of Belief Revision	p. 136
Time Complexity and Convergence Analysis of Domain Theoretic Picard Method	p. 149
On the Formal Semantics of IF-Like Logics	p. 164
One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations	p. 179
Labelled Calculi for Lukasiewicz Logics	p. 194
An Infinitely-Often One-Way Function Based on an Average-Case Assumption	p. 208
On Characteristic Constants of Theories Defined by Kolmogorov Complexity	p. 218
Adversary Lower Bounds for Nonadaptive Quantum Algorithms	p. 226
On Second-Order Monadic Groupoidal Quantifiers	p. 238
Inference Processes for Quantified Predicate Knowledge	p. 249
Using [alpha]-CTL to Specify Complex Planning Goals	p. 260
Hyperintensional Questions	p. 272
Skolem Theory and Generalized Quantifiers	p. 286
On a Graph Calculus for Algebras of Relations	p. 298
Author Index	p. 313
Table of Contents provided by Blackwell. All Rights Reserved.