Browse Results

Select your format based upon: 1) how you want to read your book, and 2) compatibility with your reading tool. To learn more about using Bookshare with your device, visit the Help Center.

Here is an overview of the specialized formats that Bookshare offers its members with links that go to the Help Center for more information.

• Bookshare Web Reader - A customized reading tool for Bookshare members offering all the features of DAISY with a single click of the "Read Now" link.
• DAISY (Digital Accessible Information System) - A digital book file format. DAISY books from Bookshare are DAISY 3.0 text files that work with just about every type of access technology that reads text. Books that contain images will have the download option of ‘DAISY Text with Images’.
• BRF (Braille Refreshable Format) - Digital Braille for use with refreshable Braille devices and Braille embossers.
• MP3 (MPEG audio layer 3) - Provides audio only with no text. These books are created with a text-to-speech engine and spoken by Kendra, a high quality synthetic voice from Ivona. Any device that supports MP3 playback is compatible.
• DAISY Audio - Similar to the DAISY option above; however, this option uses MP3 files created with our text-to-speech engine that utilizes Ivonas Kendra voice. This format will work with Daisy Audio compatible players such as Victor Reader Stream and Read2Go.
• EPUB - A standard e-book format that can be read on many tools, such as iBooks, Readium or others.
• Word - Accessible Word output, which can be unzipped and opened in any tool that allows .docx files

Automated Deduction - CADE-17: 17th International Conference on Automated Deduction Pittsburgh, PA, USA, June 17-20, 2000 Proceedings (Lecture Notes in Computer Science #1831)

For the past 25 years the CADE conference has been the major forum for the presentation of new results in automated deduction. This volume contains the papers and system descriptions selected for the 17th International Conference on Automated Deduction, CADE-17, held June 17-20, 2000,at Carnegie Mellon University, Pittsburgh, Pennsylvania (USA). Fifty-three research papers and twenty system descriptions were submitted by researchers from ?fteen countries. Each submission was reviewed by at least three reviewers. Twenty-four research papers and ?fteen system descriptions were accepted. The accepted papers cover a variety of topics related to t- orem proving and its applications such as proof carrying code, cryptographic protocol veri?cation, model checking, cooperating decision procedures, program veri?cation, and resolution theorem proving. The program also included three invited lectures: “High-level veri?cation using theorem proving and formalized mathematics” by John Harrison, “Sc- able Knowledge Representation and Reasoning Systems” by Henry Kautz, and “Connecting Bits with Floating-Point Numbers: Model Checking and Theorem Proving in Practice” by Carl Seger. Abstracts or full papers of these talks are included in this volume.In addition to the accepted papers, system descriptions, andinvited talks, this volumecontains one page summaries of four tutorials and ?ve workshops held in conjunction with CADE-17.

Automated Deduction - CADE-18: 18th International Conference on Automated Deduction, Copenhagen, Denmark, July 27-30, 2002 Proceedings (Lecture Notes in Computer Science #2392)

The First CADE in the Third Millennium This volume contains the papers presented at the Eighteenth International C- ference on Automated Deduction (CADE-18) held on July 27–30th, 2002, at the University of Copenhagen as part of the Federated Logic Conference (FLoC 2002). Despite a large number of deduction-related conferences springing into existence at the end of the last millennium, the CADE conferences continue to be the major forum for the presentation of new research in all aspects of automated deduction. CADE-18 was sponsored by the Association for Auto- ted Reasoning, CADE Inc., the Department of Computer Science at Chalmers University, the Gesellschaft fur ¨ Informatik, Safelogic AB, and the University of Koblenz-Landau. There were 70 submissions, including 60 regular papers and 10 system - scriptions. Each submission was reviewed by at least ?ve program committee members and an electronic program committee meeting was held via the Int- net. The committee decided to accept 27 regular papers and 9 system descr- tions. One paper switched its category after refereeing, thus the total number of system descriptions in this volume is 10. In addition to the refereed papers, this volume contains an extended abstract of the CADE invited talk by Ian Horrocks, the joint CADE/CAV invited talk by Sharad Malik, and the joint CADE-TABLEAUX invited talk by Matthias Baaz. One more invited lecture was given by Daniel Jackson.

Automated Deduction - CADE-19: 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28 - August 2, 2003, Proceedings (Lecture Notes in Computer Science #2741)

The refereed proceedings of the 19th International Conference on Automated Deduction, CADE 2003, held in Miami Beach, FL, USA in July 2003. The 29 revised full papers and 7 system description papers presented together with an invited paper and 3 abstracts of invited talks were carefully reviewed and selected from 83 submissions. All current aspects of automated deduction are discussed, ranging from theoretical and methodological issues to the presentation of new theorem provers and systems.

Automated Deduction - CADE-21: 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings (Lecture Notes in Computer Science #4603)

A veritable one-stop-shop for anyone looking to get up to speed on what is going down in the field of automated deduction right now. This book contains the refereed proceedings of the 21st International Conference on Automated Deduction, CADE-21, held in Bremen, Germany, in July 2007. The 28 revised full papers and 6 system descriptions presented were selected from 64 submissions. All current aspects of automated deduction are addressed, ranging from theoretical and methodological issues to presentation and evaluation of theorem provers and logical reasoning systems.

Automated Deduction -- CADE-23: 23rd International Conference on Automated Deduction, Wrocław, Poland, July 31 -- August 5, 2011, Proceedings (Lecture Notes in Computer Science #6803)

This book constitutes the refereed proceedings of the 23rd International Conference on Automated Deduction, CADE-23, held in Wrocław, Poland, in July/August 2011. The 28 revised full papers and 7 system descriptions presented were carefully reviewed and selected from 80 submissions. Furthermore, four invited lectures by distinguished experts in the area were included. Among the topics addressed are systems and tools for automated reasoning, rewriting logics, security protocol verification, unification, theorem proving, clause elimination, SAT, satifiability, interactive theorem proving, theory reasoning, static analysis, decision procedures, etc.

Automated Deduction -- CADE-24: 24th International Conference on Automated Deduction, Lake Placid, NY, USA, June 9-14, 2013, Proceedings (Lecture Notes in Computer Science #7898)

This book constitutes the proceedings of the 24th International Conference on Automated Deduction, CADE-24, held in Lake Placid, NY, USA, in June 2013. The 31 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 71 initial submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, ranging from theoretical and methodological issues to the presentation of new theorem provers, solvers and systems.

Automated Deduction in Classical and Non-Classical Logics: Selected Papers (Lecture Notes in Computer Science #1761)

Automated Deduction in Geometry: 10th International Workshop, ADG 2014, Coimbra, Portugal, July 9-11, 2014, Revised Selected Papers (Lecture Notes in Computer Science #9201)

This book constitutes the thoroughly refereed post-workshop proceedings of the 10th International Workshop on Automated Deduction in Geometry, ADG 2014, held in Coimbra, Portugal, in July 2014. The 11 revised full papers presented in this volume were carefully selected from 20 submissions. The papers show the trend set of current research in automated reasoning in geometry.

Automated Deduction in Geometry: 6th International Workshop, ADG 2006, Pontevedra, Spain, August 31-September 2, 2006, Revised Papers (Lecture Notes in Computer Science #4869)

The papers in this volume show the lively variety of topics and methods in automated deduction in geometry, and their applicability to different branches of mathematics as well as to other sciences and technologies. The book is made up of the thoroughly refereed post-proceedings of the 6th International Workshop on Automated Deduction in Geometry, ADG 2006, held at Pontevedra, Spain, in 2006. There are a total of 13 revised full papers selected from a number of submissions.

Automated Deduction in Geometry: Second International Workshop, ADG'98, Beijing, China, August 1-3, 1998, Proceedings (Lecture Notes in Computer Science #1669)

The Second International Workshop on Automated Deduction in Geometry (ADG ’98) was held in Beijing, China, August 1–3, 1998. An increase of interest in ADG ’98 over the previous workshop ADG ’96 is represented by the notable number of more than 40 participants from ten countries and the strong tech- cal program of 25 presentations, of which two one-hour invited talks were given by Professors Wen-tsun ¨ Wu and Jing-Zhong Zhang. The workshop provided the participants with a well-focused forum for e?ective exchange of new ideas and timely report of research progress. Insight surveys, algorithmic developments, and applications in CAGD/CAD and computer vision presented by active - searchers, together with geometry software demos, shed light on the features of this second workshop. ADG ’98 was hosted by the Mathematics Mechanization Research Center (MMRC) with ?nancial support from the Chinese Academy of Sciences and the French National Center for Scienti?c Research (CNRS), and was organized by the three co-editors of this proceedings volume. The papers contained in the volume were selected, under a strict refereeing procedure, from those presented at ADG ’98 and submitted afterwards. Most of the 14 accepted papers were carefully revised and some of the revised versions were checked again by external reviewers. We hope that these papers cover some of the most recent and signi?cant research results and developments and re?ect the current state-of-the-art of ADG.

Automated Deduction in Geometry: 5th International Workshop, ADG 2004, Gainesville, FL, USA, September 16-18, 2004, Revised Papers (Lecture Notes in Computer Science #3763)

This book presents the thoroughly refereed post-proceedings of the 5th International Workshop on Automated Deduction in Geometry, ADG 2004, held at Gainesville, FL, USA in September 2004. The 12 revised full papers presented aurvey current issues theoretical and methodological topics as well as applications thereof - in particular automated geometry theorem proving, automated geometry problem solving, problems of dynamic geometry, and an object-oriented language for geometric objects.

Automated Deduction in Geometry: 9th International Workshop, ADG 2012, Edinburgh, UK, September 17-19, 2012. Revised Selected Papers (Lecture Notes in Computer Science #7993)

This book constitutes the thoroughly refereed post-workshop proceedings of the 9th International Workshop on Automated Deduction in Geometry, ADG 2012, held in Edinburgh, UK, in September 2012. The 10 revised full papers presented together with 2 invited papers were carefully selected during two rounds of reviewing and improvement from the lectures given at the workshop. The conference represents a forum to exchange ideas and views, to present research results and progress, and to demonstrate software tools at the intersection between geometry and automated deduction; the scope of the ADG 2012 moreover has been expanded to cover topics in dynamic geometry.

Automated Deduction in Geometry: Third International Workshop, ADG 2000, Zurich, Switzerland, September 25-27, 2000, Revised Papers (Lecture Notes in Computer Science #2061)

Automated Deduction in Geometry: 8th International Workshop, ADG 2010, Munich, Germany, July 22-24, 2010, Revised Papers (Lecture Notes in Computer Science #6877)

This book constitutes the thoroughly refereed post-workshop proceedings of the 8th International Workshop on Automated Deduction in Geometry, ADG 2010, held in Munich, Germany in July 2010. The 13 revised full papers presented were carefully selected during two rounds of reviewing and improvement from the lectures given at the workshop. Topics addressed by the papers are incidence geometry using some kind of combinatoric argument; computer algebra; software implementation; as well as logic and proof assistants.

Automated Deduction in Geometry: 7th International Workshop, ADG 2008, Shanghai, China, September 22-24, 2008, Revised Papers (Lecture Notes in Computer Science #6301)

This book constitutes the thoroughly refereed post-workshop proceedings of the 7th International Workshop on Automated Deduction in Geometry, ADG 2008, held in Shanghai, China in September 2008. The 11 revised full papers presented were carefully reviewed and selected from numerous initial submissions for the workshop during two rounds of reviewing and improvement. The papers show the lively variety of topics and methods and the current applicability of automated deduction in geometry to different branches of mathematics such as discrete mathematics, combinatorics, and numerics; symbolic and numeric methods for geometric computation, and geometric constraint solving. Further issues are the design and implementation of geometry software, special-purpose tools, automated theorem provers - in short applications of ADG to mechanics, geometric modeling, CAGD/CAD, computer vision, robotics and education.

Automated Deduction in Geometry: 4th International Workshop, ADG 2002, Hagenberg Castle, Austria, September 4-6, 2002, Revised Papers (Lecture Notes in Computer Science #2930)

This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Automated Deduction in Geometry, ADG 2002, held at Hagenberg Castle, Austria in September 2002. The 13 revised full papers presented were carefully selected during two rounds of reviewing and improvement. Among the issues addressed are theoretical and methodological topics, such as the resolution of singularities, algebraic geometry and computer algebra; various geometric theorem proving systems are explored; and applications of automated deduction in geometry are demonstrated in fields like computer-aided design and robotics.

Automated Market Makers: A Practical Guide to Decentralized Exchanges and Cryptocurrency Trading

Explore Automated Market Makers (AMMs), the underlying protocols used by decentralized exchanges (DEX) to allow users to perform trades of cryptocurrencies in a decentralized way with no middlemen. This book provides a thorough study and a clear-cut exposition of the principal AMMs (Uniswap v2 and v3, Balancer, and Curve).You'll receive a detailed description of how these AMMs work, unveiling the mathematics behind them and showing plenty of examples as well as novel proofs for several interesting facts. Each chapter describes an AMM's core idea and derives the mathematical formulas used in the code, giving careful explanations of the logical thinking involved and detailing the steps needed to reach those formulas. All these explanations are complemented with thoughtfully chosen examples which further help to enlighten the readers on how the formulae work. In addition, the relevant parts of the codes of the AMMs are shown after explaining each formula so that the actual implementation of the formulae can be seen.In a traditional trading market a buy order has to be matched with a sell order to achieve a trade. However, for an AMM, users trade against the protocol itself, a smart contract, or a community pool of funds. In simple terms this is an open source computer program in which mathematical formulas define prices. Automated Market Makers examines this critical point revealing that no banks or intermediaries are necessary, giving crucial financial access to a much larger crowd, regardless of who they are with less barriers to access.What You'll LearnUnderstand the principals of decentralized finance (DeFi)Grasp mathematical formulae that underpin decentralized exchangesWork with Solidity programming languageReview current industry best practices Who This Book Is ForThose new to Blockchain and Cryptocurrency trading, who want to learn more about AMMsDevelopers who want to dive deeper into the core features of AMM platformsInvestors and venture capitalists who want to know more about new emerging technologies

Automated Mathematical Induction

It has been shown how the common structure that defines a family of proofs can be expressed as a proof plan [5]. This common structure can be exploited in the search for particular proofs. A proof plan has two complementary components: a proof method and a proof tactic. By prescribing the structure of a proof at the level of primitive inferences, a tactic [11] provides the guarantee part of the proof. In contrast, a method provides a more declarative explanation of the proof by means of preconditions. Each method has associated effects. The execution of the effects simulates the application of the corresponding tactic. Theorem proving in the proof planning framework is a two-phase process: 1. Tactic construction is by a process of method composition: Given a goal, an applicable method is selected. The applicability of a method is determined by evaluating the method's preconditions. The method effects are then used to calculate subgoals. This process is applied recursively until no more subgoals remain. Because of the one-to-one correspondence between methods and tactics, the output from this process is a composite tactic tailored to the given goal. 2. Tactic execution generates a proof in the object-level logic. Note that no search is involved in the execution of the tactic. All the search is taken care of during the planning process. The real benefits of having separate planning and execution phases become appar­ ent when a proof attempt fails.

Automated Model Building (Applied Logic Series #31)

On the history of the book: In the early 1990s several new methods and perspectives in au- mated deduction emerged. We just mention the superposition calculus, meta-term inference and schematization, deductive decision procedures, and automated model building. It was this last ?eld which brought the authors of this book together. In 1994 they met at the Conference on Automated Deduction (CADE-12) in Nancy and agreed upon the general point of view, that semantics and, in particular, construction of models should play a central role in the ?eld of automated deduction. In the following years the deduction groups of the laboratory LEIBNIZ at IMAG Grenoble and the University of Technology in Vienna organized several bilateral projects promoting this topic. This book emerged as a main result of this cooperation. The authors are aware of the fact, that the book does not cover all relevant methods of automated model building (also called model construction or model generation); instead the book focuses on deduction-based symbolic methods for the construction of Herbrand models developed in the last 12 years. Other methods of automated model building, in particular also ?nite model building, are mainly treated in the ?nal chapter; this chapter is less formal and detailed but gives a broader view on the topic and a comparison of di?erent approaches. Howtoreadthisbook: In the introduction we give an overview of automated deduction in a historical context, taking into account its relationship with the human views on formal and informal proofs.

Automated Practical Reasoning: Algebraic Approaches (Texts & Monographs in Symbolic Computation)

This book is a collection of selected papers written by researchers qf our "RISC" institute (Research Institute for Symbolic Computation) along with the ESPRIT MEDLAR Project (Mechanizing Deduction in the Logics of Practical Reason­ ing). Naturally, the MEDLAR Project was and is the focal point for our institute whose main objective is the combination of foundational research in the area of symbolic computation and possible applications thereof for high-tech industrial projects. I am grateful to the director of the MEDLAR project, Jim Cunningham, for his enthusiasm, profound expertise, and continuous effort to manage a fruitful cooperation between various European working groups in the area of the project and for giving us the opportunity to be part of this challenging endeavor. I also acknowledge and feel indebted to Jochen Pfalzgraf for managing the RISC part of the MEDLAR project and to both him and Dongming Wang for editing this volume and organizing the refereeing process.

Automated Reasoning: 4th International Joint Conference, IJCAR 2008, Sydney, NSW, Australia, August 12-15, 2008, Proceedings (Lecture Notes in Computer Science #5195)

This book constitutes the refereed proceedings of the 4th International Joint Conference on Automated Reasoning, IJCAR 2008, held in Sydney, Australia, in August 2008. The 26 revised full research papers and 13 revised system descriptions presented together with 4 invited papers and a summary of the CASC-J4 systems competition were carefully reviewed and selected from 80 full paper and 17 system description submissions. The papers address the entire spectrum of research in automated reasoning and are organized in topical sections on specific theories, automated verification, protocol verification, system descriptions, modal logics, description logics, equational theories, theorem proving, CASC, the 4th IJCAR ATP system competition, logical frameworks, and tree automata.

Automated Reasoning: Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, Proceedings (Lecture Notes in Computer Science #3097)

This volume constitutes the proceedings of the 2nd International Joint C- ference on Automated Reasoning (IJCAR 2004) held July 4–8, 2004 in Cork, Ireland. IJCAR 2004 continued the tradition established at the ?rst IJCAR in Siena,Italyin2001,whichbroughttogetherdi?erentresearchcommunitieswo- ing in automated reasoning. The current IJCAR is the fusion of the following conferences: CADE: The International Conference on Automated Deduction, CALCULEMUS: Symposium on the Integration of Symbolic Computation and Mechanized Reasoning, FroCoS: Workshop on Frontiers of Combining Systems, FTP: The International Workshop on First-Order Theorem Proving, and TABLEAUX: The International Conference on Automated Reasoning with Analytic Tableaux and Related Methods. There were 74 research papers submitted to IJCAR as well as 12 system descriptions. After extensive reviewing, 26 research papers and 6 system - scriptions were accepted for presentation at the conference and publication in this volume. In addition, this volume also contains papers from the three invited speakers and a description of the CADE ATP system competition. We would like to acknowledge the enormous amount of work put in by the members of the program committee, the various organizing and steering c- mittees, the IJCAR o?cials, the invited speakers, and the additional referees named on the following pages. We would also like to thank Achim Brucker and Barbara Geiser for their help in producing this volume.

Automated Reasoning: 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8–10, 2022, Proceedings (Lecture Notes in Computer Science #13385)

This volume, LNAI 13385, constitutes the refereed proceedings of the 11th International Joint Conference on Automated Reasoning, IJCAR 2022, held in Haifa, Israel, in August 2022. The 32 full research papers and 9 short papers presented together with two invited talks were carefully reviewed and selected from 85 submissions. The papers focus on the following topics: Satisfiability, SMT Solving,Arithmetic; Calculi and Orderings; Knowledge Representation and Jutsification; Choices, Invariance, Substitutions and Formalization; Modal Logics; Proofs System and Proofs Search; Evolution, Termination and Decision Prolems.This is an open access book.

Automated Reasoning: Essays in Honor of Woody Bledsoe (Automated Reasoning Series #1)

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.

Automated Reasoning: 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, Vienna, Austria, July 19-22, 2014, Proceedings (Lecture Notes in Computer Science #8562)

This book constitutes the refereed proceedings of the 7th International Joint Conference on Automated Reasoning, IJCAR 2014, held as part of the Vienna Summer of Logic, VSL 2014, in Vienna, Austria, in July 2014. IJCAR 2014 was a merger of three leading events in automated reasoning, namely CADE (International Conference on Automated Deduction), FroCoS (International Symposium on Frontiers of Combining Systems) and TABLEAUX (International Conference on Automated Reasoning with Analytic Tableaux and Related Methods). The 26 revised full research papers and 11 system descriptions presented together with 3 invited talks were carefully reviewed and selected from 83 submissions. The papers have been organized in topical sections on HOL, SAT and QBF, SMT, equational reasoning, verification, proof theory, modal and temporal reasoning, SMT and SAT, modal logic, complexity, description logics and knowledge representation and reasoning.