Logical Foundations of Computer Science

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

  • Editors
  • Sergei N. Artemov
  • Anil Nerode
Conference proceedings LFCS 2007

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

Table of contents

  1. Front Matter
    PDF
  2. Justified and Common Knowledge: Limited Conservativity
    Evangelia Antonakos
    Pages 1-11
  3. The Intensional Lambda Calculus
    Sergei Artemov, Eduardo Bonelli
    Pages 12-25
  4. Generalized Non-deterministic Matrices and (n,k)-ary Quantifiers
    Arnon Avron, Anna Zamansky
    Pages 26-40
  5. Elementary Differential Calculus on Discrete and Hybrid Structures
    Howard A. Blair, David W. Jakel, Robert J. Irwin, Angel Rivera
    Pages 41-53
  6. Weighted Distributed Systems and Their Logics
    Benedikt Bollig, Ingmar Meinecke
    Pages 54-68
  7. Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
    Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
    Pages 69-83
  8. On Decidability and Expressiveness of Propositional Interval Neighborhood Logics
    Davide Bresolin, Valentin Goranko, Angelo Montanari, Guido Sciavicco
    Pages 84-99
  9. Reasoning About Sequences of Memory States
    Rémi Brochenin, Stéphane Demri, Etienne Lozes
    Pages 100-114
  10. Cut Elimination in Deduction Modulo by Abstract Completion
    Guillaume Burel, Claude Kirchner
    Pages 115-131
  11. Density Elimination and Rational Completeness for First-Order Logics
    Agata Ciabattoni, George Metcalfe
    Pages 132-146
  12. Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus
    Robert Constable, Wojciech Moczydłowski
    Pages 147-161
  13. Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics
    J. M. Davoren
    Pages 162-179
  14. A Decidable Temporal Logic of Repeating Values
    Stéphane Demri, Deepak D’Souza, Régis Gascon
    Pages 180-194
  15. Model Checking Knowledge and Linear Time: PSPACE Cases
    Kai Engelhardt, Peter Gammie, Ron van der Meyden
    Pages 195-211
  16. Realizations and LP
    Melvin Fitting
    Pages 212-223
  17. Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking
    R. Gentilini, K. Schneider, B. Mishra
    Pages 224-240
  18. Explicit Proofs in Formal Provability Logic
    Evan Goris
    Pages 241-253
  19. A Synthesis Algorithm for Hybrid Systems
    Srikanth Gottipati, Anil Nerode
    Pages 254-268
  20. Including the Past in ‘Topologic’
    Bernhard Heinemann
    Pages 269-283

About these proceedings

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

  • DOI https://doi.org/10.1007/978-3-540-72734-7
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-72732-3
  • Online ISBN 978-3-540-72734-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book