Computer Science Logic - neues Buch

EAN (ISBN-13): 9783540452201
Erscheinungsjahr: 2003
Herausgeber: Springer Berlin Heidelberg

Buch in der Datenbank seit 2016-12-27T13:48:48+01:00 (Berlin)
Detailseite zuletzt geändert am 2024-05-14T17:04:09+02:00 (Berlin)
ISBN/EAN: 9783540452201

ISBN - alternative Schreibweisen:
978-3-540-45220-1
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: makowsky, baaz, matthias
Titel des Buches: august, austria international, logic computer science, colloquium, vienna workshop

---

Daten vom Verlag:

Autor/in: Matthias Baaz; Johann M. Makowsky
Titel: Lecture Notes in Computer Science; 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
Verlag: Springer; Springer Berlin
596 Seiten
Erscheinungsjahr: 2003-12-10
Berlin; Heidelberg; DE
Sprache: Englisch
96,29 € (DE)
99,00 € (AT)
118,00 CHF (CH)
Available
XII, 596 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; AI logics; Constraint Satisfaction; algorithm; algorithms; classical logic; complexity; computer science logic; higher order logic; logic; logical foundations; mathematical logic; model checking; proof theory; semantics; verification; C; Formal Languages and Automata Theory; Humanities and Social Sciences; Computer Science Logic and Foundations of Programming; Artificial Intelligence; Mathematical Logic and Foundations; Computer Science; Interdisziplinäre Studien; Künstliche Intelligenz; Mathematik: Logik; Mathematische Grundlagen; BC

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 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.
Includes supplementary material: sn.pub/extras