Cantitate/Preț
Produs

Computer Science Logic: 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010, Proceedings: Lecture Notes in Computer Science, cartea 6247

Editat de Anuj Dawar, Helmut Veith
en Limba Engleză Paperback – 11 aug 2010

Din seria Lecture Notes in Computer Science

Preț: 33545 lei

Preț vechi: 41932 lei
-20% Nou

Puncte Express: 503

Preț estimativ în valută:
6420 6773$ 5350£

Carte disponibilă

Livrare economică 12-26 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642152047
ISBN-10: 364215204X
Pagini: 548
Ilustrații: XIV, 548 p. 64 illus.
Greutate: 0.86 kg
Ediția:2010
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Invited Talks.- Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries.- Definability in Games.- From Feasible Proofs to Feasible Computations.- Tree Dualities for Constraint Satisfaction.- Ordered Sets in the Calculus of Data Structures.- Abductive, Inductive and Deductive Reasoning about Resources.- Constraint Solving for Program Verification: Theory and Practice by Example.- Contributed Papers.- Tableau Calculi for over minspaces.- A Resolution Mechanism for Prenex Gödel Logic.- Efficient Enumeration for Conjunctive Queries over X-underbar Structures.- A Formalisation of the Normal Forms of Context-Free Grammars in HOL4.- Automata vs. Logics on Data Words.- Graded Computation Tree Logic with Binary Coding.- Exact Exploration and Hanging Algorithms.- Embedding Deduction Modulo into a Prover.- Exponentials with Infinite Multiplicities.- Classical and Intuitionistic Subexponential Logics Are Equally Expressive.- On Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT.- A Logic of Sequentiality.- Environment and Classical Channels in Categorical Quantum Mechanics.- Formal Theories for Linear Algebra.- Energy and Mean-Payoff Games with Imperfect Information.- Randomisation and Derandomisation in Descriptive Complexity Theory.- Towards a Canonical Classical Natural Deduction System.- Coordination Logic.- Second-Order Equational Logic (Extended Abstract).- Fibrational Induction Rules for Initial Algebras.- A Sequent Calculus with Implicit Term Representation.- New Algorithm for Weak Monadic Second-Order Logic on Inductive Structures.- The Structural ?-Calculus.- The Isomorphism Problem for ?-Automatic Trees.- Complexity Results for Modal Dependence Logic.- The Complexity of Positive First-Order Logic without EqualityII: The Four-Element Case.- On the Computability of Region-Based Euclidean Logics.- Inductive-Inductive Definitions.- Quantified Differential Dynamic Logic for Distributed Hybrid Systems.- Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic.- Two-Variable Logic with Two Order Relations.- Signature Extensions Preserve Termination.- Coq Modulo Theory.- Ackermann Award.- The Ackermann Award 2010.

Caracteristici

Fast-track conference proceedings