Logical Foundations of Computer Science: International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings (Lecture Notes in Computer Science (5407))

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 of logic in computer science are addressed, including constructive mathematics and type theory, logical foundations of programming, logical aspects of computational complexity, logic programming and constraints, automated deduction and interactive theorem proving, logical methods in protocol and program verification and in program specification and extraction, domain theory logics, logical foundations of database theory, equational logic and term rewriting, lambda and combinatory calculi, categorical logic and topological semantics, linear logic, epistemic and temporal logics, intelligent and multiple agent system logics, logics of proof and justification, nonmonotonic reasoning, logic in game theory and social software, logic of hybrid systems, distributed system logics, system design logics, as well as other logics in computer science. Front Matter....Pages - Applications of Finite Duality to Locally Finite Varieties of BL-Algebras....Pages 1-15 Completeness Results for Memory Logics....Pages 16-30 Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination....Pages 31-45 Temporalization of Probabilistic Propositional Logic....Pages 46-60 Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings....Pages 61-75 The Logic of Proofs as a Foundation for Certifying Mobile Computation....Pages 76-91 ATL with Strategy Contexts and Bounded Memory....Pages 92-106 A Relational Model of a Parallel and Non-deterministic λ -Calculus....Pages 107-121 The NP-Completeness of Reflected Fragments of Justification Logics....Pages 122-136 Taming Modal Impredicativity: Superlazy Reduction....Pages 137-151 Positive Fork Graph Calculus....Pages 152-163 Games on Strings with a Limited Order Relation....Pages 164-179 Complete Axiomatizations of MSO , FO(TC 1 ) and FO(LFP 1 ) on Finite Trees....Pages 180-196 Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic....Pages 197-213 A Clausal Approach to Proof Analysis in Second-Order Logic....Pages 214-229 Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics....Pages 230-245 Light Linear Logic with Controlled Weakening....Pages 246-264 Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm....Pages 265-279 Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System....Pages 280-294 Tableaux and Hypersequents for Justification Logic....Pages 295-308 Topological Forcing Semantics with Settling....Pages 309-322 Automata and Answer Set Programming....Pages 323-337 A Labeled Natural Deduction System for a Fragment of CTL * ....Pages 338-353 Conservativity for Logics of Justified Belief....Pages 354-364 Unifying Sets and Programs via Dependent Types....Pages 365-379 Product-Free Lambek Calculus Is NP-Complete....Pages 380-394 Games on Multi-stack Pushdown Systems....Pages 395-408 Data Privacy for $\mathcal{ALC}$ Knowledge Bases....Pages 409-421 Fixed Point Theorems on Partial Randomness....Pages 422-440 Decidability and Undecidability in Probability Logic....Pages 441-450 A Bialgebraic Approach to Automata and Formal Language Theory....Pages 451-467 Back Matter....Pages - This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2013, held in San Diego, CA, USA in January 2013. The volume presents 29 revised refereed papers carefully selected by the program committee. The scope of the Symposium is broad and includes constructive mathematics and type theory; logic, automata and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logic; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justification; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; and other logics in computer science.

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 of logic in computer science are addressed, including constructive mathematics and type theory, logical foundations of programming, logical aspects of computational complexity, logic programming and constraints, automated deduction and interactive theorem proving, logical methods in protocol and program verification and in program specification and extraction, domain theory logics, logical foundations of database theory, equational logic and term rewriting, lambda and combinatory calculi, categorical logic and topological semantics, linear logic, epistemic and temporal logics, intelligent and multiple agent system logics, logics of proof and justification, nonmonotonic reasoning, logic in game theory and social software, logic of hybrid systems, distributed system logics, system design logics, as well as other logics in computer science.

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. This title presents 31 revised refereed papers that were selected by the program committee.