Fundamentals of Logic and Computation: With Practical Automated Reasoning and Verification, Hou Zhe

Автор: Petr Hajek
Название: Metamathematics of First-Order Arithmetic
ISBN: 1107168414 ISBN-13(EAN): 9781107168411
Издательство: Cambridge Academ
Рейтинг:
Цена: 16743.00 р. 23918.00 -30%
Наличие на складе: Есть (1 шт.)
Описание: This much-needed monograph on the metamathematics of first-order arithmetic pays particular attention to subsystems (fragments) of Peano arithmetic and gives the reader a deeper understanding of the role of the axiom schema of induction and of the phenomenon of incompleteness.

Автор: Darwiche
Название: Modeling and Reasoning with Bayesian Networks
ISBN: 1107678420 ISBN-13(EAN): 9781107678422
Издательство: Cambridge Academ
Рейтинг:
Цена: 9821.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book provides a thorough introduction to the formal foundations and practical applications of Bayesian networks. It provides an extensive discussion of techniques for building Bayesian networks that model real-world situations, including techniques for synthesizing models from design, learning models from data, and debugging models using sensitivity analysis.

Автор: Schuster Peter M., Seisenberger Monika, Weiermann Andreas
Название: Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive
ISBN: 3030302288 ISBN-13(EAN): 9783030302283
Издательство: Springer
Рейтинг:
Цена: 20733.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos.

Автор: Schuster Peter M., Seisenberger Monika, Weiermann Andreas
Название: Well-Quasi Orders in Computation, Logic, Language and Reasoning: A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive
ISBN: 3030302318 ISBN-13(EAN): 9783030302313
Издательство: Springer
Цена: 20733.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos.

Автор: Walton
Название: Goal-based Reasoning for Argumentation
ISBN: 1107119049 ISBN-13(EAN): 9781107119048
Издательство: Cambridge Academ
Рейтинг:
Цена: 12670.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Practical argumentation is intelligent reasoning from an agent`s goals and known circumstances, and from an action selected as a means, to arrive at a decision on what action to take. This book will appeal to a wide audience, from designers of multi-agent and robotics systems to social scientists.

Автор: Gabriel Ciobanu; Gheorghe Paun
Название: Fundamentals of Computation Theory
ISBN: 3540664122 ISBN-13(EAN): 9783540664123
Издательство: Springer
Рейтинг:
Цена: 12805.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This text covers topics such as abstract data types, algorithms and data structures, automata and formal languages, categorical and topological approaches, complexity, computational geometry, concurrency, cryptology, distributed computing, logics in computer science and process algebras.

Автор: Horst Reichel
Название: Fundamentals of Computation Theory
ISBN: 3540602496 ISBN-13(EAN): 9783540602491
Издательство: Springer
Рейтинг:
Цена: 10610.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This text constitutes the proceedings of the 10th International Conference on Fundamentals of Computation Theory, FCT `95, held in Dresden, Germany. Among topics addressed are algorithms and data structures, automata and formal languages.

Автор: Lothar Budach
Название: Fundamentals of Computation Theory
ISBN: 3540156895 ISBN-13(EAN): 9783540156895
Издательство: Springer
Рейтинг:
Цена: 5731.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Автор: Ralf Klasing; Marc Zeitoun
Название: Fundamentals of Computation Theory
ISBN: 3662557509 ISBN-13(EAN): 9783662557501
Издательство: Springer
Рейтинг:
Цена: 8537.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017, held in Bordeaux, France, in September 2017. The 29 revised full papers and 5 invited papers presented were carefully reviewed and selected from 99 submissions.

Автор: Adrian Kosowski; Igor Walukiewicz
Название: Fundamentals of Computation Theory
ISBN: 3319221760 ISBN-13(EAN): 9783319221762
Издательство: Springer
Рейтинг:
Цена: 6830.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the refereed proceedings of the 20th International Symposium on Fundamentals of Computation Theory, FCT 2015, held in Gdansk, Poland, in August 2015. The papers cover topics in three main areas: algorithms, formal methods, and emerging fields and are organized in topical sections on geometry, combinatorics, text algorithms;

Автор: Ulrich Kulisch; Hans J. Stetter
Название: Scientific Computation with Automatic Result Verification
ISBN: 3211820639 ISBN-13(EAN): 9783211820636
Издательство: Springer
Рейтинг:
Цена: 10610.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This work collects a number of contributions which aim to compute rigorous and reliable error bounds for the solution of numerical problems. An introduction by the editors about the meaning and diverse methods of automatic result verification is followed by 16 original contributions.

Автор: Leszek Antoni G?sieniec; Jesper Jansson; Christos
Название: Fundamentals of Computation Theory
ISBN: 3030250261 ISBN-13(EAN): 9783030250263
Издательство: Springer
Рейтинг:
Цена: 6097.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the proceedings of the 22nd International Symposium on Fundamentals of Computation Theory, FCT 2019, held in Copenhagen, Denmark, in August 2019.The 21 full papers included in this volume were carefully reviewed and selected from 45 submissions. In addition, the book contains 3 invited talks in full-paper length. The papers were organized in topical sections named: formal methods, complexity, and algorithms.