Logical Foundations of Computer Science International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Artemov, Sergei (Επιμελητής έκδοσης), Nerode, Anil (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
• Σειρά: Lecture Notes in Computer Science, 5407
• Θέματα: Computer science.; Arithmetic and logic units, Computer.; Algorithms.; Computer logic.; Mathematical logic.; Computer science > Mathematics.; Computer Science.; Logics and Meanings of Programs.; Algorithm Analysis and Problem Complexity.; Mathematical Logic and Foundations.; Mathematical Logic and Formal Languages.; Arithmetic and Logic Structures.; Symbolic and Algebraic Manipulation.

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2009, held in Deerfield Beach, Florida, USA in January 2008. The volume presents 31 revised refereed papers carefully selected by the program committee. All current aspects...

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

• Applications of Finite Duality to Locally Finite Varieties of BL-Algebras
• Completeness Results for Memory Logics
• Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
• Temporalization of Probabilistic Propositional Logic
• Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
• The Logic of Proofs as a Foundation for Certifying Mobile Computation
• ATL with Strategy Contexts and Bounded Memory
• A Relational Model of a Parallel and Non-deterministic ?-Calculus
• The NP-Completeness of Reflected Fragments of Justification Logics
• Taming Modal Impredicativity: Superlazy Reduction
• Positive Fork Graph Calculus
• Games on Strings with a Limited Order Relation
• Complete Axiomatizations of MSO, FO(TC 1 ) and FO(LFP 1 ) on Finite Trees
• Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic
• A Clausal Approach to Proof Analysis in Second-Order Logic
• Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
• Light Linear Logic with Controlled Weakening
• Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm
• Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
• Tableaux and Hypersequents for Justification Logic
• Topological Forcing Semantics with Settling
• Automata and Answer Set Programming
• A Labeled Natural Deduction System for a Fragment of CTL *
• Conservativity for Logics of Justified Belief
• Unifying Sets and Programs via Dependent Types
• Product-Free Lambek Calculus Is NP-Complete
• Games on Multi-stack Pushdown Systems
• Data Privacy for Knowledge Bases
• Fixed Point Theorems on Partial Randomness
• Decidability and Undecidability in Probability Logic
• A Bialgebraic Approach to Automata and Formal Language Theory.