Computer Science Logic 24th International Workshop, CSL 2010, 19th Annual Conference of the EACSL, Brno, Czech Republic, August 23-27, 2010. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Dawar, Anuj (Επιμελητής έκδοσης), Veith, Helmut (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2010.
• Σειρά: Lecture Notes in Computer Science, 6247
• Θέματα: Computer science.; Software engineering.; Computer programming.; Computers.; Computer logic.; Mathematical logic.; Artificial intelligence.; Computer Science.; Theory of Computation.; Programming Techniques.; Software Engineering/Programming and Operating Systems.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.; Artificial Intelligence (incl. Robotics).

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

• 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.