Amazon cover image
Image from Amazon.com
Image from Google Jackets

Computer Science Logic [electronic resource] : 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings / edited by Anuj Dawar, Helmut Veith.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 6247Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010Description: XIV, 548p. 64 illus. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783642152054
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.1015113 23
LOC classification:
  • QA76.9.L63
  • QA76.5913
  • QA76.63
Online resources:
Contents:
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 Equality II: 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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK9227

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 Equality II: 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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India