Logical Foundations of Computer Science: International Symposium, Lfcs 2009, Deerfield Beach, Fl, Usa, January 3-6, 2009, Proceedings

ISBN-13: 9783540926863 / Angielski / Miękka / 2008 / 469 str.

Sergei Artemov

Opis

The Symposium on Logical Foundations of Computer Science series provides a forum for the fast-growing body of work in the logical foundations of computer science, e.g., those areas of fundamental theoretical logic related to computer science. The LFCS series began with "Logic at Botik," Pereslavl-Zalessky,1989, which was co-organized by Albert R. Meyer (MIT) and Michael Taitslin (Tver). After that, organization passed to Anil Nerode. Currently LFCS is governed by a Steering Committee consisting of Anil Nerode (General Chair), Stephen Cook, Dirk van Dalen, Yuri Matiyasevich, John McCarthy, J. Alan Robinson, Gerald Sacks, and Dana Scott. The 2009 Symposium on Logical Foundations of Computer Science (LFCS 2009) took place in Howard Johnson Plaza Resort, Deer?eld Beach, Florida, USA, during January 3-6. This volume contains the extended abstracts of talks selected by the Program Committee for presentation at LFCS 2009. The scope of the symposium is broad and contains constructive mathematics and type theory; automata and automatic structures; computability and r- domness; logical foundations of programming; logical aspects of computational complexity; logic programmingand constraints;automated deduction and int- active theorem proving; logical methods in protocol and program veri?cation; logical methods in program speci?cation and extraction; domain theory l- ics; logical foundations of database theory; equational logic and term rewriting; lambda andcombinatorycalculi;categoricallogicandtopologicalsemantics;l- ear logic; epistemic and temporal logics; intelligent and multiple agent system logics; logics of proof and justi?cation; nonmonotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics;

Spis treści

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.

Blurb

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.