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ț: 1061.55 lei
- 20% Preț: 307.71 lei
- 20% Preț: 438.69 lei
- 20% Preț: 645.28 lei
- Preț: 410.88 lei
- 17% Preț: 427.22 lei
- 20% Preț: 596.46 lei
- Preț: 381.21 lei
- 20% Preț: 353.50 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 309.90 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 310.26 lei
- 20% Preț: 655.02 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 15% Preț: 438.59 lei
- 20% Preț: 591.51 lei
- 20% Preț: 649.49 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 607.39 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 825.93 lei
- 20% Preț: 763.23 lei
- 17% Preț: 360.19 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 340.32 lei
- 20% Preț: 504.57 lei
- 20% Preț: 369.12 lei
- 20% Preț: 583.40 lei
- 20% Preț: 343.62 lei
- 20% Preț: 350.21 lei
- 20% Preț: 764.89 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 341.95 lei
- 20% Preț: 238.01 lei
- 20% Preț: 538.29 lei
Preț: 580.46 lei
Preț vechi: 682.90 lei
-15% Nou
Puncte Express: 871
Preț estimativ în valută:
111.09€ • 115.09$ • 92.71£
111.09€ • 115.09$ • 92.71£
Carte disponibilă
Livrare economică 01-15 martie
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.