Computer Science Logic 17th International Workshop, CSL 2003, 12th Annual Conference of the EACSL, and 8th Kurt Gödel Colloquium, KGC 2003, Vienna, Austria, August 25-30, 2003, Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Baaz, Matthias (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Makowsky, Johann M. (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
• Έκδοση: 1st ed. 2003.
• Σειρά: Lecture Notes in Computer Science, 2803
• Θέματα: Mathematical logic.; Computer logic.; Artificial intelligence.; Mathematical Logic and Formal Languages.; Science, Humanities and Social Sciences, multidisciplinary.; Logics and Meanings of Programs.; Artificial Intelligence.; Mathematical Logic and Foundations.

This book constitutes the joint refereed proceedings of the 17th International Workshop on Computer Science Logic, CSL 2003, held as the 12th Annual Conference of the EACSL and of the 8th Kurt Gödel Colloquium, KGC 2003 in Vienna, Austria, in August 2003. The 30 revised full papers presented toget...

Πίνακας περιεχομένων:

• 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 ? ws -Calculus
• 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
• The Arithmetical Complexity of Dimension and Randomness
• Towards a Proof System for Admissibility
• Program Complexity of Dynamic LTL Model Checking
• Coping Polynomially with Numerous but Identical Elements within Planning Problems
• On Algebraic Specifications of Abstract Data Types
• On the Complexity of Existential Pebble Games
• Computational Aspects of ?-Definability over the Real Numbers without the Equality Test
• The Surprising Power of Restricted Programs and Gödel's Functionals
• Pebble Games on Trees
• Bistability: An Extensional Characterization of Sequentiality
• Automata on Lempel-Ziv Compressed Strings
• Complexity of Some Problems in Modal and Intuitionistic Calculi
• Goal-Directed Calculi for Gödel-Dummett Logics
• A Logic for Probability in Quantum Systems
• A Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
• The Epsilon Calculus
• Modular Semantics and Logics of Classes
• Validity of CTL Queries Revisited
• Calculi of Meta-variables
• Henkin Models of the Partial ?-Calculus
• Nominal Unification
• Friends or Foes? Communities in Software Verification
• More Computation Power for a Denotational Semantics for First Order Logic
• Effective Model Completeness of the Theory of Restricted Pfaffian Functions
• Effective Quantifier Elimination over Real Closed Fields
• Fast Infinite-State Model Checking in Integer-Based Systems
• Winning Strategies and Synthesis of Controllers
• Logical Relations for Dynamic Name Creation.