Skip to main content
  • Conference proceedings
  • © 2007

Logical Foundations of Computer Science

International Symposium, LFCS 2007, New York, NY, USA, June 4-7, 2007, Proceedings

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

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

Conference series link(s): LFCS: International Symposium on Logical Foundations of Computer Science

Conference proceedings info: LFCS 2007.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (35 papers)

  1. Front Matter

  2. The Intensional Lambda Calculus

    • Sergei Artemov, Eduardo Bonelli
    Pages 12-25
  3. Elementary Differential Calculus on Discrete and Hybrid Structures

    • Howard A. Blair, David W. Jakel, Robert J. Irwin, Angel Rivera
    Pages 41-53
  4. Weighted Distributed Systems and Their Logics

    • Benedikt Bollig, Ingmar Meinecke
    Pages 54-68
  5. Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!

    • Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
    Pages 69-83
  6. On Decidability and Expressiveness of Propositional Interval Neighborhood Logics

    • Davide Bresolin, Valentin Goranko, Angelo Montanari, Guido Sciavicco
    Pages 84-99
  7. Reasoning About Sequences of Memory States

    • Rémi Brochenin, Stéphane Demri, Etienne Lozes
    Pages 100-114
  8. Cut Elimination in Deduction Modulo by Abstract Completion

    • Guillaume Burel, Claude Kirchner
    Pages 115-131
  9. Density Elimination and Rational Completeness for First-Order Logics

    • Agata Ciabattoni, George Metcalfe
    Pages 132-146
  10. A Decidable Temporal Logic of Repeating Values

    • Stéphane Demri, Deepak D’Souza, Régis Gascon
    Pages 180-194
  11. Model Checking Knowledge and Linear Time: PSPACE Cases

    • Kai Engelhardt, Peter Gammie, Ron van der Meyden
    Pages 195-211
  12. Realizations and LP

    • Melvin Fitting
    Pages 212-223
  13. Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking

    • R. Gentilini, K. Schneider, B. Mishra
    Pages 224-240
  14. A Synthesis Algorithm for Hybrid Systems

    • Srikanth Gottipati, Anil Nerode
    Pages 254-268
  15. Including the Past in ‘Topologic’

    • Bernhard Heinemann
    Pages 269-283

Other Volumes

  1. Logical Foundations of Computer Science

Keywords

  • Automat
  • automated deduction
  • complexity
  • computer
  • computer science
  • database
  • distributed systems
  • game theory
  • interactive theorem proving
  • logic
  • programming
  • semantics
  • term rewriting
  • theorem proving
  • verification

Bibliographic Information

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions