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

Portada
Springer Science & Business Media, 13 de febr. 2009 - 469 pàgines
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;
 

Què opinen els usuaris - Escriviu una ressenya

No hem trobat cap ressenya als llocs habituals.

Continguts

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
ATL with Strategy Contexts and Bounded Memory
92
A Relational Model of a Parallel and Nondeterministic λCalculus
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 MSO FOTC¹ and FOLFP¹ 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 ALC 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

Altres edicions - Mostra-ho tot

Frases i termes més freqüents

Informació bibliogràfica