计算机科学逻辑/会议录Computer science logic
分類: 图书,计算机/网络,计算机理论,
作者: Julian Bradfield著
出 版 社: 湖南文艺出版社
出版时间: 2002-12-1字数:版次: 1页数: 610印刷时间: 2006/12/01开本:印次:纸张: 胶版纸I S B N : 9783540442400包装: 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science resarch forum available.
The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material publised traditionally includes.
-proceedings(published in time for the respective conference)
-post-proceedings(consisting of thoroughly revised final full papers)
-research monographs(which may be basde on outstanding PhD work, research projects, technical reports, etc.)
内容简介
This book constitutes the refereed proceedings of the 16th International Workshop on Computer Science Logic, CSL 2002, held as the 11th Annual Conference of the EACSL in Edinburgh, Scotland, UK, in September 2002.The 37 revised full papers presented together with 3 invited papers were carefully reviewed and selected from 111 submissions. The papers are organized in topical sections on rewriting and constructive mathematics; fixpoints and recursion; linear and resource logics; semantics; temporal logics and games; probability, games, and fixpoints; complexity and proof complexity; ludics and linear logics, lambda-calculi; and resolution and proofs.
目录
Invited Lectures
Limit-Computable Mathematics and Its Applications
Automata, Logic, and XML
u-Calculus via Games (Extended Abstract)
Rewriting and Constructive Mathematics
Bijections between Partitions by Two-Directional Rewriting Techniques
On Continuous Normalization
Variants of Realizability for Propositional Formulas and the Logicof the Weak Law of Excluded Middle
Compactness and Continuity, Constructively Revisited
Fixpoints and Recursion
Hoare Logics for Recursive Procedures and Unbounded Nondeterminisrn
A Fixpoint Theory for Non-monotonic Parallelism
Greibach Normal Form in Algebraically Complete Semirings
Linear and Resource Logics
Proofnets and Context Semantics for the Additives
A Tag-Frame System of Resource Management for Proof Searchin Linear-Logic Programming
Resource Tableaux
Semantics
Configuration Theories
A Logic for Probabilities in Semantics
Possible World Semantics for General Storage in Call-By-Value
A Fully Abstract Relational Model of Syntactic Control of Interference
Temporal Logics and Games
Optimal Complexity Bounds for Positive LTL Games
The Stuttering Principle Revisited: On the Expressivenessof Nested X and U Operators in the Logic LTL
Trading Probability for Fairness
Probability, Games and Fixpoints
A Logic of Probability with Decidable Model-Checking
Solving Pushdown Games with a Za Winning Condition
Partial Fixed-Point Logic on Infinite Structures
On the Variable Hierarchy of the Modal #-Calculus
Complexity and Proof Complexity
Ludics and Linear Logic
Lambda-Calculi
Resolution and Proofs
Author Index