This book constitutes the refereed proceedings of the 21st International Workshop on Computer Science Logic, CSL 2007, held as the 16th Annual Conference of the EACSL in Lausanne, Switzerland. The 36 revised full papers presented together with the abstracts of six invited lectures are organized in topical sections on logic and games, expressiveness, games and trees, logic and deduction, lambda calculus, finite model theory, linear logic, proof theory, and game semantics.

Produktinformation

Utgivningsdatum2007-08-30
Mått155 x 235 x 33 mm
Vikt920 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor600
Upplaga2007
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540749141

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programspråk inom Data och IT

Invited Lectures.- Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract).- The Symbolic Approach to Repeated Games (Abstract).- Proofs, Programs and Abstract Complexity.- Model-Checking First-Order Logic: Automata and Locality.- Tightening the Exchange Rates Between Automata.- Precise Relational Invariants Through Strategy Iteration.- Logic and Games.- Omega-Regular Half-Positional Winning Conditions.- Clique-Width and Parity Games.- Logical Refinements of Church’s Problem.- The Power of Counting Logics on Restricted Classes of Finite Structures.- Expressiveness.- Comparing the Expressive Power of Well-Structured Transition Systems.- There Exist Some ?-Powers of Any Borel Rank.- Games and Trees.- Satisfiability of a Spatial Logic with Tree Variables.- Forest Expressions.- MSO on the Infinite Binary Tree: Choice and Order.- Logic and Deduction.- Classical and Intuitionistic Logic Are Asymptotically Identical.- Qualitative Temporal and Spatial Reasoning Revisited.- On Acyclic Conjunctive Queries and Constant Delay Enumeration.- Integrating Linear Arithmetic into Superposition Calculus.- Lambda Calculus 1.- The Theory of Calculi with Explicit Substitutions Revisited.- A Soft Type Assignment System for ?-Calculus.- Lambda Theories of Effective Lambda Models.- Typed Normal Form Bisimulation.- Lambda Calculus 2.- Not Enough Points Is Enough.- Classical Program Extraction in the Calculus of Constructions.- Building Decision Procedures in the Calculus of Inductive Constructions.- Finite Model Theory.- Structure Theorem and Strict Alternation Hierarchy for FO2 on Words.- On the Complexity of Reasoning About Dynamic Policies.- Relativizing Small Complexity Classes and Their Theories.- Subexponential Time and Fixed-ParameterTractability: Exploiting the Miniaturization Mapping.- Linear Logic.- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic.- Linear Realizability.- Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete.- Focusing and Polarization in Intuitionistic Logic.- Proof Theory.- Incorporating Tables into Proofs.- A Cut-Free and Invariant-Free Sequent Calculus for PLTL.- Unbounded Proof-Length Speed-Up in Deduction Modulo.- Propositional Logic for Circuit Classes.- Game Characterizations and the PSPACE-Completeness of Tree Resolution Space.- Game Semantics.- Continuous Previsions.- Bad Variables Under Control.- A Games Model of Bunched Implications.- The Ackermann Award 2007.

Mer från samma serie

Agent Mediated Electronic Commerce II

Alexandros Moukas, Carles Sierra, Fredrik Ygge

Häftad, 2000

749 kr

COLOG-88

Per Martin-Löf, Grigori Mints

Häftad, 1990

719 kr

Compiler Construction

Albert Cohen

Häftad, 2014

719 kr

Del 16375

Interactive Storytelling

María Cecilia Reyes, Frank Nack

Häftad, 2025

719 kr

Theory of Cryptography

Yehuda Lindell

Häftad, 2014

749 kr

Reliable Software Technology – Ada-Europe 2005

Tullio Vardanega, Andy Wellings

Häftad, 2005

749 kr

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki - Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries, Häftad

Del 16376

Segmentation, Classification, and Synthesis for Brain Tumors and Traumatic Brain Injuries

Spyridon Bakas, Emily Dennis, Mehdi Astaraki, Ujjwal Baid, Gian Marco Conte, Martha Foltyn-Dumitru, Zhifan Jiang, Dominic Labella, Marie-Christin Metz, Udunna Anazodo, Maria Correia de Verdier, Florian Kofler, Hongwei Bran Li, Marius George Linguraru, Nazanin Maleki

Häftad, 2026

1 219 kr

Objects and Databases

Alan Dearle, Roberto V. Zicari

Häftad, 2010

749 kr

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi - Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops, Häftad

Del 15401

Medical Image Computing and Computer Assisted Intervention – MICCAI 2024 Workshops

Anna Schroder, Xiang Li, Tanveer Syeda-Mahmood, Neil P. Oxtoby, Alexandra Young, Alessa Hering, Tejas S. Mathai, Pritam Mukherjee, Sven Kuckertz, Tiantian He, Isaac Llorente-Saguer, Andreas Maier, Satyananda Kashyap, Hayit Greenspan, Anant Madabhushi

Häftad, 2025

969 kr

Del 16625

Web Engineering

Andrea Mauri, Lola Burgueño, Riccardo Tommasini

Luke Ong

Häftad, 2005

749 kr

Del i serien Lecture Notes in Computer Science

Computer Science Logic

21 International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings

Häftad, Engelska, 2007

AvJacques Duparc,Thomas A. Henzinger

1 479 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (10)

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

749 kr

Skickas inom 10-15 vardagar

Häftad

1 439 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

1 479 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Häftad

719 kr

Skickas inom 10-15 vardagar

Produktinformation

Utgivningsdatum2007-08-30
Mått155 x 235 x 33 mm
Vikt920 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor600
Upplaga2007
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540749141

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programspråk inom Data och IT

Invited Lectures.- Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract).- The Symbolic Approach to Repeated Games (Abstract).- Proofs, Programs and Abstract Complexity.- Model-Checking First-Order Logic: Automata and Locality.- Tightening the Exchange Rates Between Automata.- Precise Relational Invariants Through Strategy Iteration.- Logic and Games.- Omega-Regular Half-Positional Winning Conditions.- Clique-Width and Parity Games.- Logical Refinements of Church’s Problem.- The Power of Counting Logics on Restricted Classes of Finite Structures.- Expressiveness.- Comparing the Expressive Power of Well-Structured Transition Systems.- There Exist Some ?-Powers of Any Borel Rank.- Games and Trees.- Satisfiability of a Spatial Logic with Tree Variables.- Forest Expressions.- MSO on the Infinite Binary Tree: Choice and Order.- Logic and Deduction.- Classical and Intuitionistic Logic Are Asymptotically Identical.- Qualitative Temporal and Spatial Reasoning Revisited.- On Acyclic Conjunctive Queries and Constant Delay Enumeration.- Integrating Linear Arithmetic into Superposition Calculus.- Lambda Calculus 1.- The Theory of Calculi with Explicit Substitutions Revisited.- A Soft Type Assignment System for ?-Calculus.- Lambda Theories of Effective Lambda Models.- Typed Normal Form Bisimulation.- Lambda Calculus 2.- Not Enough Points Is Enough.- Classical Program Extraction in the Calculus of Constructions.- Building Decision Procedures in the Calculus of Inductive Constructions.- Finite Model Theory.- Structure Theorem and Strict Alternation Hierarchy for FO2 on Words.- On the Complexity of Reasoning About Dynamic Policies.- Relativizing Small Complexity Classes and Their Theories.- Subexponential Time and Fixed-ParameterTractability: Exploiting the Miniaturization Mapping.- Linear Logic.- From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic.- Linear Realizability.- Correctness of Multiplicative (and Exponential) Proof Structures is NL-Complete.- Focusing and Polarization in Intuitionistic Logic.- Proof Theory.- Incorporating Tables into Proofs.- A Cut-Free and Invariant-Free Sequent Calculus for PLTL.- Unbounded Proof-Length Speed-Up in Deduction Modulo.- Propositional Logic for Circuit Classes.- Game Characterizations and the PSPACE-Completeness of Tree Resolution Space.- Game Semantics.- Continuous Previsions.- Bad Variables Under Control.- A Games Model of Bunched Implications.- The Ackermann Award 2007.