Skip to main content
SpringerLink
Log in

Computer Science Logic

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

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Jacques Duparc
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Thomas A. Henzinger
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4646)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: CSL 2007.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (43 papers)

  1. Front Matter

    Download chapter PDF

  3. Logic and Games

    1. Omega-Regular Half-Positional Winning Conditions

      • Eryk KopczyÅ„ski
      Pages 41-53

    2. Clique-Width and Parity Games

      • Jan Obdržálek
      Pages 54-68

    3. Logical Refinements of Church’s Problem

      • Alexander Rabinovich, Wolfgang Thomas
      Pages 69-83

    4. The Power of Counting Logics on Restricted Classes of Finite Structures

      • Anuj Dawar, David Richerby
      Pages 84-98

  4. Expressiveness

    1. Comparing the Expressive Power of Well-Structured Transition Systems

      • Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van Begin
      Pages 99-114

    2. There Exist Some ω-Powers of Any Borel Rank

      • Olivier Finkel, Dominique Lecomte
      Pages 115-129

  5. Games and Trees

    1. Satisfiability of a Spatial Logic with Tree Variables

      • Emmanuel Filiot, Jean-Marc Talbot, Sophie Tison
      Pages 130-145

    2. Forest Expressions

      • MikoÅ‚aj BojaÅ„czyk
      Pages 146-160

    3. MSO on the Infinite Binary Tree: Choice and Order

      • Arnaud Carayol, Christof Löding
      Pages 161-176

  6. Logic and Deduction

    1. Classical and Intuitionistic Logic Are Asymptotically Identical

      • Hervé Fournier, Danièle Gardy, Antoine Genitrini, Marek Zaionc
      Pages 177-193

    2. Qualitative Temporal and Spatial Reasoning Revisited

      • Manuel Bodirsky, Hubie Chen
      Pages 194-207

    3. On Acyclic Conjunctive Queries and Constant Delay Enumeration

      • Guillaume Bagan, Arnaud Durand, Etienne Grandjean
      Pages 208-222

    4. Integrating Linear Arithmetic into Superposition Calculus

      • Konstantin Korovin, Andrei Voronkov
      Pages 223-237
Back to top

Other volumes

  1. Computer Science Logic

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation