Computer Science Logic [electronic resource] : 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September /
Workshop on Computer Science LogicCorporate Author
Workshop on Computer Science Logic(16th :2002 :Edinburgh, Scotland)
Workshop on Computer Science Logic
Bradfield, Julian.editor.
European Association for Computer Science Logic.Conference(11th :2002 :Edinburgh, Scotland)
The Annual Conference of the European Association for Computer Science Logic, CSL 2002, was held in the Old College of the University of Edinburgh on 22–25 September 2002. The conference series started as a programme of Int- national Workshops on Computer Science Logic, and then in its sixth meeting became the Annual Conference of the EACSL. This conference was the sixteenth meeting and eleventh EACSL conference; it was organized by the Laboratory for Foundations of Computer Science at the University of Edinburgh. The CSL 2002 Programme Committee considered 111 submissions from 28 countries during a two week electronic discussion; each paper was refereed by at least three reviewers. The Committee selected 37 papers for presentation at the conference and publication in these proceedings. The Programme Committee invited lectures from Susumu Hayashi, Frank Neven, and Damian Niwinski; ´ the papers provided by the invited speakers appear at the front of this volume. In addition to the main conference, two tutorials – ‘Introduction to Mu- Calculi’ (Julian Brad?eld) and ‘Parametrized Complexity’ (Martin Grohe) – were given on the previous day.
Includes index.
Invited Lectures -- Limit-Computable Mathematics and Its Applications -- Automata, Logic, and XML -- ?-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 Logic of the Weak Law of Excluded Middle -- Compactness and Continuity, Constructively Revisited -- Fixpoints and Recursion -- Hoare Logics for Recursive Procedures and Unbounded Nondeterminism -- 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 Search in 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 Expressiveness of Nested X and ? 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 ?3 Winning Condition -- Partial Fixed-Point Logic on Infinite Structures -- On the Variable Hierarchy of the Modal ?-Calculus -- Complexity and Proof Complexity -- Implicit Computational Complexity for Higher Type Functionals -- On Generalizations of Semi-terms of Particularly Simple Form -- Local Problems, Planar Local Problems and Linear Time -- Equivalence and Isomorphism for Boolean Constraint Satisfaction -- Ludics and Linear Logic -- Travelling on Designs -- Designs, Disputes and Strategies -- Classical Linear Logic of Implications -- Lambda-Calculi -- Higher-Order Positive Set Constraints -- A Proof Theoretical Account of Continuation Passing Style -- Duality between Call-by-Name Recursion and Call-by-Value Iteration -- Decidability of Bounded Higher-Order Unification -- Open Proofs and Open Terms: A Basis for Interactive Logic -- Logical Relations for Monadic Types -- Resolution and Proofs -- On the Automatizability of Resolution and Related Propositional Proof Systems -- Extraction of Proofs from the Clausal Normal Form Transformation -- Resolution Refutations and Propositional Proofs with Height-Restrictions.
The Annual Conference of the European Association for Computer Science Logic, CSL 2002, was held in the Old College of the University of Edinburgh on 22–25 September 2002. The conference series started as a programme of Int- national Workshops on Computer Science Logic, and then in its sixth meeting became the Annual Conference of the EACSL. This conference was the sixteenth meeting and eleventh EACSL conference; it was organized by the Laboratory for Foundations of Computer Science at the University of Edinburgh. The CSL 2002 Programme Committee considered 111 submissions from 28 countries during a two week electronic discussion; each paper was refereed by at least three reviewers. The Committee selected 37 papers for presentation at the conference and publication in these proceedings. The Programme Committee invited lectures from Susumu Hayashi, Frank Neven, and Damian Niwinski; ´ the papers provided by the invited speakers appear at the front of this volume. In addition to the main conference, two tutorials – ‘Introduction to Mu- Calculi’ (Julian Brad?eld) and ‘Parametrized Complexity’ (Martin Grohe) – were given on the previous day.
Computers.
Programming languages (Electronic computers).
Mathematical logic.
Artificial intelligence.
Computer logic.
Theory of Computation.
Programming Languages, Compilers, Interpreters.
Mathematical Logic and Formal Languages.
Artificial Intelligence.
Logics and Meanings of Programs.
Mathematical Logic and Foundations.