Automated Reasoning Series – serie
Visar alla böcker i serien Automated Reasoning Series. Handla med fri frakt och snabb leverans.
5 produkter
5 produkter
Del 2 - Automated Reasoning Series
Automated Development of Fundamental Mathematical Theories
Inbunden, Engelska, 1992
2 331 kr
Skickas inom 10-15 vardagar
The author provides an introduction to automated reasoning, and in particular to resolution theorem proving using the prover OTTER. He presents a new clausal version of von Neumann-Bernays-Godel set theory, and lists over 400 theorems proved semiautomatically in elementary set theory. He presents a semiautomated proof that the composition of homomorphisms is a homomorphism, thus solving a challenge problem. The author next develops Peano's arithmetic, and gives more than 1200 definitions and theorems in elementary number theory. He gives part of the proof of the fundamental theorem of arithmetic (unique factorization), and gives and OTTER-generated proof of Euler's generalization of Fermat's theorem. Next he develops Tarski's geometry within OTTER. He obtains proofs of most of the challenge problems appearing in the literature, and offers further challenges. He then formalizes the modal logic calculus K4, in order to obtain very high level automated proofs of Lob's theorem, and of Godel's two incompleteness theorems. Finally he offers thirty-one unsolved problems in elementary number theory as challenge problems.
1 095 kr
Skickas inom 10-15 vardagar
This text presents a new algebraic framework for the design and analysis of resolution-based automated reasoning systems for a range of non-classical logics. It develops an algebraic theory of resolution proof systems focusing on the problems of proof theory, representation and efficiency of the deductive process. A new class of logical calculi, the class of resolution logics, emerges as a second theme of the book. The logical and computational aspects of the relationship between resolution logics and resolution proof systems is explored in the context of monotonic as well as nonmonotonic reasoning. This book is aimed primarily at researchers and graduate students in artificial intelligence, symbolic and computational logic. The material is suitable as a reference book for researchers and as a text book for graduate courses on the theoretical aspects of automated reasoning and computational logic.
1 064 kr
Skickas inom 10-15 vardagar
These essays have been written to honor W. W. Bledsoe, a scientist who has contributed to such diverse fields as mathematics, systems analysis, pattern recognition, biology, artificial intelligence, and automated reasoning. The first essay provides a sketch of his life, emphasizing his scientific contributions. The diversity of the fields to which Bledsoe has contributed is reflected in the range of the other essays, which are original scientific contributions by some of his many friends and colleagues. Bledsoe is a founding father of the field of automated reasoning, and a majority of the essays are on that topic. These essays are collected together here not only to acknowledge Bledsoe's manifold and substantial scientific contributions but also to express our appreciation for the great care and energy that he has devoted to nurturing many of the scientists working in those scientific fields he has helped found. Robert S. Boyer Austin February, 1991 ix Acknow ledgements Thanks to Larry Wos, editor of the Journal of Automated Reasoning, and Derek Middleton and Martin Scrivener, Kluwer Academic editors, for sup porting the idea of initiating this collection of essays. Thanks to A. Michael Ballantyne and Michael Spivak, for help with lffi.TWC, especially in identifying many formatting problems and providing fixes.
1 064 kr
Skickas inom 10-15 vardagar
Resolution Proof Systems: An Algebraic Theory presents a new algebraic framework for the design and analysis of resolution- based automated reasoning systems for a range of non-classical logics. It develops an algebraic theory of resolution proof systems focusing on the problems of proof theory, representation and efficiency of the deductive process. A new class of logical calculi, the class of resolution logics, emerges as a second theme of the book. The logical and computational aspects of the relationship between resolution logics and resolution proof systems is explored in the context of monotonic as well as nonmonotonic reasoning. This book is aimed primarily at researchers and graduate students in artificial intelligence, symbolic and computational logic. The material is suitable as a reference book for researchers and as a text book for graduate courses on the theoretical aspects of automated reasoning and computational logic.
Del 3 - Automated Reasoning Series
Piton
A Mechanically Verified Assembly-Level Language
Häftad, Engelska, 2013
535 kr
Skickas inom 10-15 vardagar
Mountaineers use pitons to protect themselves from falls. The lead climber wears a harness to which a rope is tied. As the climber ascends, the rope is paid out by a partner on the ground. As described thus far, the climber receives no protection from the rope or the partner. However, the climber generally carries several spike-like pitons and stops when possible to drive one into a small crack or crevice in the rock face. After climbing just above the piton, the climber clips the rope to the piton, using slings and carabiners. A subsequent fall would result in the climber hanging from the piton—if the piton stays in the rock, the slings and carabiners do not fail, the rope does not break, the partner is holding the rope taut and secure, and the climber had not climbed too high above the piton before falling. The climber's safety clearly depends on all of the components of the system. But the piton is distinguished because it connects the natural to the artificial. In 1987 I designed an assembly-level language for Warren Hunt's FM8501 verified microprocessor. I wanted the language to be conveniently used as the object code produced by verified compilers. Thus, I envisioned the language as the first software link in a trusted chain from verified hardware to verified applications programs. Thinking of the hardware as the "rock" I named the language "Piton.