000 05546nam a22006255i 4500
001 978-3-540-45220-1
003 DE-He213
005 20240423132543.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 _a9783540452201
_9978-3-540-45220-1
024 7 _a10.1007/b13224
_2doi
050 4 _aQA267-268.5
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a005.131
_223
245 1 0 _aComputer Science Logic
_h[electronic resource] :
_b17th 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 /
_cedited by Matthias Baaz, Johann M. Makowsky.
250 _a1st ed. 2003.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2003.
300 _aXII, 596 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2803
505 0 _aDeciding 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 forGö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.
520 _a 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 together with abstracts of 9 invited presentations were carefully reviewed and selected from a total of 112 submissions. All current aspects of computer science logic are addressed ranging from mathematical logic and logical foundations to the application of logics in various computing aspects.
650 0 _aMachine theory.
650 0 _aSocial sciences.
650 0 _aHumanities.
650 0 _aComputer science.
650 0 _aArtificial intelligence.
650 0 _aMathematical logic.
650 1 4 _aFormal Languages and Automata Theory.
650 2 4 _aHumanities and Social Sciences.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aArtificial Intelligence.
650 2 4 _aMathematical Logic and Foundations.
700 1 _aBaaz, Matthias.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aMakowsky, Johann M.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540408017
776 0 8 _iPrinted edition:
_z9783662185407
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2803
856 4 0 _uhttps://doi.org/10.1007/b13224
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c189046
_d189046