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

Copertina anteriore
Springer Science & Business Media, 13 feb 2009 - 469 pagine

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.

 

Pagine selezionate

Sommario

Applications of Finite Duality to Locally Finite Varieties of BLAlgebras
1
Completeness Results for Memory Logics
16
Canonical Signed Calculi Nondeterministic Matrices and CutElimination
31
Temporalization of Probabilistic Propositional Logic
46
Logic and BoundedWidth Rational Languages of Posets over Countable Scattered Linear Orderings
61
The Logic of Proofs as a Foundation for Certifying Mobile Computation
76
sfATL with Strategy Contexts and Bounded Memory
92
A Relational Model of a Parallel and Nondeterministic lambdaCalculus
107
Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm
265
Quantitative Comparison of Intuitionistic and Classical Logics Full Propositional System
280
Tableaux and Hypersequents for Justification Logic
295
Topological Forcing Semantics with Settling
309
Automata and Answer Set Programming
323
A Labeled Natural Deduction System for a Fragment of CTL
338
Conservativity for Logics of Justified Belief
354
Unifying Sets and Programs via Dependent Types
365

The NPCompleteness of Reflected Fragments of Justification Logics
122
Superlazy Reduction
137
Positive Fork Graph Calculus
152
Games on Strings with a Limited Order Relation
164
Complete Axiomatizations of sfMSO sfFOTC1 and sfFOLFP1 on Finite Trees
180
TableauBased Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic
197
A Clausal Approach to Proof Analysis in SecondOrder Logic
214
Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
230
Light Linear Logic with Controlled Weakening
246
ProductFree Lambek Calculus Is NPComplete
380
Games on Multistack Pushdown Systems
395
Data Privacy for mathcalALC Knowledge Bases
409
Fixed Point Theorems on Partial Randomness
422
Decidability and Undecidability in Probability Logic
441
A Bialgebraic Approach to Automata and Formal Language Theory
451
Author Index
468
Copyright

Altre edizioni - Visualizza tutto

Parole e frasi comuni

Informazioni bibliografiche