Atjaunināt sīkdatņu piekrišanu

Logical Foundations of Computer Science: International Symposium, LFCS 2009, Deerfield Beach, FL, USA, January 3-6, 2009, Proceedings 2009 ed. [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 469 pages, height x width: 235x155 mm, weight: 736 g, XI, 469 p., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 5407
  • Izdošanas datums: 18-Dec-2008
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540926860
  • ISBN-13: 9783540926863
  • Mīkstie vāki
  • Cena: 46,91 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 55,19 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
  • Formāts: Paperback / softback, 469 pages, height x width: 235x155 mm, weight: 736 g, XI, 469 p., 1 Paperback / softback
  • Sērija : Theoretical Computer Science and General Issues 5407
  • Izdošanas datums: 18-Dec-2008
  • Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • ISBN-10: 3540926860
  • ISBN-13: 9783540926863
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.

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.
Applications of Finite Duality to Locally Finite Varieties of BL-Algebras
1(15)
Stefano Aguzzoli
Simone Bova
Vincenzo Marra
Completeness Results for Memory Logics
16(15)
Carlos Areces
Santiago Figueira
Sergio Mera
Canonical Signed Calculi, Non-deterministic Matrices and Cut-Elimination
31(15)
Arnon Avron
Anna Zamansky
Temporalization of Probabilistic Propositional Logic
46(15)
Pedro Baltazar
Paulo Mateus
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
61(15)
Nicolas Bedon
The Logic of Proofs as a Foundation for Certifying Mobile Computation
76(16)
Eduardo Bonelli
Federico Feller
ATL with Strategy Contexts and Bounded Memory
92(15)
Thomas Brihaye
Arnaud Da Costa
Franceois Laroussinie
Nicolas Markey
A Relational Model of a Parallel and Non-deterministic -Calculus
107(15)
Antonio Bucciarelli
Thomas Ehrhard
Giulio Manzonetto
The NP-Completeness of Reflected Fragments of Justification Logics
122(15)
Samuel R. Buss
Roman Kuznets
Taming Modal Impredicativity: Superlazy Reduction
137(15)
Ugo Dal Lago
Luca Roversi
Luca Vercelli
Positive Fork Graph Calculus
152(12)
Renata de Freitas
Sheila R.M. Veloso
Paulo A.S. Veloso
Petrucio Viana
Games on Strings with a Limited Order Relation
164(16)
Elisabetta De Maria
Angelo Montanari
Nicola Vitacolonna
Complete Axiomatizations of MSO, FO(TC1) and FO(LFP1) on Finite Trees
180(17)
Amelie Gheerbrant
Balder Tencate
Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic
197(17)
Valentin Goranko
Dmitry Shkatov
A Clausal Approach to Proof Analysis in Second-Order Logic
214(16)
Stefan Hetzl
Alexander Leitsch
Daniel Weller
Bruno Woltzenlogel Paleo
Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
230(16)
Rosalie Iemhoff
George Metcalfe
Light Linear Logic with Controlled Weakening
246(19)
Max Kanovich
Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm
265(15)
Uwe Keller
Stijn Heymans
Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
280(15)
Antoine Genitrini
Jakub Kozik
Tableaux and Hypersequents for Justification Logic
295(14)
Hidenori Kurokawa
Topological Forcing Semantics with Settling
309(14)
Robert S. Lubarsky
Automata and Answer Set Programming
323(15)
Victor Marek
Jeffrey B. Remmel
A Labeled Natural Deduction System for a Fragment of CTL
338(16)
Andrea Masini
Luca Vigano
Marco Volpe
Conservativity for Logics of Justified Belief
354(11)
Robert S. Milnikel
Unifying Sets and Programs via Dependent Types
365(15)
Wojciech Moczydlowski
Product-Free Lambek Calculus Is NP-Complete
380(15)
Yury Savateev
Games on Multi-stack Pushdown Systems
395(14)
Anil Seth
Data Privacy for ALC Knowledge Bases
409(13)
Phiniki Stouppa
Thomas Studer
Fixed Point Theorems on Partial Randomness
422(19)
Kohtaro Tadaki
Decidability and Undecidability in Probability Logic
441(10)
Sebastiaan A. Terwijn
A Bialgebraic Approach to Automata and Formal Language Theory
451(18)
James Worthington
Author Index 469