Share on TelegramComputer science logic : 17th international workshop, CSL 2003, 12th annual conference of the EACSL, 8th Kurt
Author: Baaz, Matthias, Makowsky, Johann A., 1948-, European Association for Computer Science Logic. Conference (12th : 2003 : Vienna University of Technology), Kurt Gödel Colloquium (8th : 2003 : Vienna University of Technology)
Added by: sketch
Added Date: 2015-12-30
Language: eng
Subjects: Computer logic, Fundamentele informatica, Logica, Logique (Informatique), Programmeertalen, Logique informatique, Computer logic, Fundamentele informatica, Logica, Programmeertalen, Logique (Informatique), Logische Programmierung, Theoretische Informatik, Logik, Programmierlogik, Logik, Logische Programmierung, Programmierlogik, Theoretische Informatik
Publishers: Berlin ; New York : Springer
Collections: folkscanomy miscellaneous, folkscanomy, additional collections
ISBN Number: 3540408010, 9783540408017
Pages Count: 300
PPI Count: 300
PDF Count: 1
Total Size: 312.65 MB
PDF Size: 5 MB
Extensions: djvu, gif, pdf, gz, zip, torrent, log, mrc
Downloads: 435
Views: 485
Total Files: 18
Media Type: texts
Total Files: 5
Last Modified: 2022-03-09 09:15:54
Size: 16.17 KB
Description
Author: Matthias Baaz, Johann A. Makowsky
Published by Springer Berlin Heidelberg
ISBN: 978-3-540-40801-7
DOI: 10.1007/b13224
Table of Contents:
- Deciding Monotonic Games
- The Commuting V-Diagram
- Concurrent Construction of Proof-Nets
- Back to the Future: Explicit Logic for Computer Science
- Constraint Satisfaction with Countable Homogeneous Templates
- Quantified Constraints: Algorithms and Complexity
- Verification of Infinite State Systems
- Parity of Imperfection or Fixing Independence
- Atomic Cut Elimination for Classical Logic
- Computational Mathematics, Computational Logic, and Symbolic Computation
- Simple Stochastic Parity Games
- Machine Characterizations of the Classes of the W-Hierarchy
- Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions
- On Relativisation and Complexity Gap for Resolution-Based Proof Systems
- Strong Normalization of the Typed λ
- A Fixed-Point Logic with Symmetric Choice
- Positive Games and Persistent Strategies
- Generating All Abductive Explanations for Queries on Propositional Horn Theories
- Refined Complexity Analysis of Cut Elimination
- Comparing the Succinctness of Monadic Query Languages over Finite Trees
Includes bibliographical references and index
