Logic, Language, Information, and Computation: Lecture Notes in Computer Science, cartea 13923
Editat de Helle Hvid Hansen, Andre Scedrov, Ruy J. G. B. De Queirozen Limba Engleză Paperback – 30 aug 2023
The 24 full papers (21 contributed, 3 invited) included in this book were carefully reviewed and selected from 46 submissions. The book also contains the abstracts for the 7 invited talks and 4 tutorials presented at WoLLIC 2023. The WoLLIC conference series aims at fostering interdisciplinary research in pure and applied logic.
Din seria Lecture Notes in Computer Science
- 20%
Preț: 558.53 lei - 20%
Preț: 571.88 lei - 20%
Preț: 675.83 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 620.33 lei - 20%
Preț: 560.93 lei - 20%
Preț: 633.70 lei - 20%
Preț: 678.21 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 560.93 lei - 20%
Preț: 733.68 lei - 20%
Preț: 793.92 lei - 15%
Preț: 558.12 lei - 20%
Preț: 793.92 lei - 20%
Preț: 560.93 lei - 20%
Preț: 748.63 lei - 20%
Preț: 562.49 lei - 20%
Preț: 1246.46 lei - 20%
Preț: 449.81 lei - 20%
Preț: 556.96 lei - 20%
Preț: 562.49 lei - 20%
Preț: 851.78 lei - 20%
Preț: 313.10 lei - 18%
Preț: 945.44 lei - 20%
Preț: 314.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 313.87 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 563.29 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 735.28 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 560.11 lei - 20%
Preț: 791.54 lei - 15%
Preț: 672.87 lei - 20%
Preț: 1032.47 lei - 20%
Preț: 617.17 lei - 20%
Preț: 1022.15 lei - 20%
Preț: 984.64 lei - 20%
Preț: 620.33 lei - 20%
Preț: 979.25 lei - 20%
Preț: 402.28 lei - 20%
Preț: 316.28 lei - 20%
Preț: 636.06 lei - 20%
Preț: 320.24 lei - 20%
Preț: 328.94 lei
Preț: 489.92 lei
Preț vechi: 576.38 lei
-15%
Puncte Express: 735
Carte tipărită la comandă
Livrare economică 17-31 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783031397837
ISBN-10: 3031397835
Pagini: 436
Ilustrații: XXXVIII, 395 p. 35 illus., 2 illus. in color.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1st edition 2023
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031397835
Pagini: 436
Ilustrații: XXXVIII, 395 p. 35 illus., 2 illus. in color.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.66 kg
Ediția:1st edition 2023
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
Learning Context-Free Grammars from Positive Data and Membership Queries.- The Web Still Needs Logic and Reasoning: A Short Introduction to SHACL for Logicians.- From Gödel’s Incompleteness Theorem to the completeness of bot beliefs.- Quantitative Global Memory.- Effective Skolemization.- Factive Complements are not Always Unique Entities: A Case Study with Bangla 'remember'.- Two-layered logics for paraconsistent probabilities.- An Axiom System for Hybrid Logic with Propositional Quantifiers.- An Evidence Logic Perspective on Schotch-Jennings Forcing.- A separation logic with histories of epistemic actions as resources.- Conditional Obligations in Justification Logic.- Structural Completeness and Superintuitionistic Inquisitive Logics.- Validity in Choice Logics - A Game-theoretic Investigation.- Aleatoric Propositions: Reasoning about Coins.- Towards an induction principle for nested data types.- A principledapproach to Expectation Maximisation and Latent Dirichlet Allocation using Jeffrey's update rule.- Parameterized Complexity of Propositional Inclusion and Independence Logic.- Parallelism in Realizability Models.- Bisimulations between Verbrugge models and Veltman models.- Focus-style proofs for the two-way alternation-free $\mu$-calculus.- Relevant Reasoning and Implicit Beliefs.- Decidability of modal logics of non-k-colorable graphs.- Subsumption-Linear Q-Resolution for QBF Theorem Proving.- Maximally Multi-Focused Proofs for Skew Non-Commutative MILL.