Logic, Language, Information and Computation: 15th International Workshop, WoLLIC 2008 Edinburgh, UK, July 1-4, 2008, Proceedings: Lecture Notes in Computer Science, cartea 5110
Editat de Wilfrid Hodges, Ruy de Queirozen Limba Engleză Paperback – 19 iun 2008
The 21 revised full papers presented together with the abstracts of 7 tutorials and invited lectures were carefully reviewed and selected from numerous submissions. The papers cover all pertinent subjects in computer science with particular interest in cross-disciplinary topics. Typical areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 323.14 lei - 20%
Preț: 461.32 lei - 20%
Preț: 460.98 lei - 20%
Preț: 390.41 lei - 20%
Preț: 526.98 lei - 15%
Preț: 388.21 lei - 20%
Preț: 461.21 lei - 20%
Preț: 390.08 lei - 20%
Preț: 496.30 lei - 20%
Preț: 461.21 lei - 20%
Preț: 389.45 lei - 15%
Preț: 461.53 lei - 20%
Preț: 389.63 lei - 20%
Preț: 496.68 lei - 20%
Preț: 461.70 lei - 20%
Preț: 251.97 lei - 20%
Preț: 390.86 lei - 20%
Preț: 532.16 lei - 20%
Preț: 461.52 lei - 20%
Preț: 255.72 lei - 20%
Preț: 498.10 lei - 20%
Preț: 497.19 lei - 20%
Preț: 499.02 lei - 20%
Preț: 389.82 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.86 lei - 20%
Preț: 390.92 lei - 20%
Preț: 390.08 lei - 20%
Preț: 461.45 lei - 20%
Preț: 392.36 lei - 20%
Preț: 460.75 lei - 20%
Preț: 461.32 lei - 20%
Preț: 389.90 lei - 20%
Preț: 639.26 lei - 20%
Preț: 390.66 lei - 20%
Preț: 391.57 lei - 20%
Preț: 389.57 lei - 20%
Preț: 497.97 lei - 20%
Preț: 462.36 lei - 20%
Preț: 460.67 lei - 20%
Preț: 423.95 lei - 5%
Preț: 515.91 lei - 15%
Preț: 535.55 lei - 20%
Preț: 531.90 lei - 20%
Preț: 403.00 lei - 20%
Preț: 535.41 lei - 20%
Preț: 461.25 lei - 20%
Preț: 498.17 lei - 20%
Preț: 461.52 lei - 20%
Preț: 249.77 lei
Preț: 558.12 lei
Preț vechi: 656.61 lei
-15%
Puncte Express: 837
Preț estimativ în valută:
98.77€ • 115.44$ • 85.76£
98.77€ • 115.44$ • 85.76£
Carte disponibilă
Livrare economică 30 ianuarie-13 februarie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540699361
ISBN-10: 3540699368
Pagini: 321
Ilustrații: VIII, 313 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.48 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540699368
Pagini: 321
Ilustrații: VIII, 313 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.48 kg
Ediția:2008
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Tutorials and Invited Lectures.- Inter-deriving Semantic Artifacts for Object-Oriented Programming.- On the Descriptive Complexity of Linear Algebra.- Talks on Quantum Computing.- On Game Semantics of the Affine and Intuitionistic Logics.- The Grammar of Scope.- Contributed Papers.- Conjunctive Grammars and Alternating Pushdown Automata.- Expressive Power and Decidability for Memory Logics.- Reasoning with Uncertainty by Nmatrix–Metric Semantics.- A Propositional Dynamic Logic for CCS Programs.- Towards Ontology Evolution in Physics.- Nominal Matching and Alpha-Equivalence.- Interval Additive Generators of Interval T-Norms.- Propositional Dynamic Logic as a Logic of Belief Revision.- Time Complexity and Convergence Analysis of Domain Theoretic Picard Method.- On the Formal Semantics of IF-Like Logics.- One-and-a-Halfth Order Terms: Curry-Howard and Incomplete Derivations.- Labelled Calculi for ?ukasiewicz Logics.- An Infinitely-Often One-Way Function Based on an Average-Case Assumption.- On Characteristic Constants of Theories Defined by Kolmogorov Complexity.- Adversary Lower Bounds for Nonadaptive Quantum Algorithms.- On Second-Order Monadic Groupoidal Quantifiers.- Inference Processes for Quantified Predicate Knowledge.- Using ? -ctl to Specify Complex Planning Goals.- Hyperintensional Questions.- Skolem Theory and Generalized Quantifiers.- On a Graph Calculus for Algebras of Relations.