leitsch alexander (22 Ergebnisse)

Paperback. Zustand: Very Good. Paperback in very good condition. From the offices of Bell Northern Europe. Lecture Notes in Computer Science; 713. Minor shelfwear to the cover. Label on inside front cover; stamp on half title page. The binding is sound with clear content throughout. CM. Used.

Hardcover. VIII, 300 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. D03764 9783540618829 Sprache: Englisch Gewicht in Gramm: 550.

Zustand: Sehr gut. 308 p. In very good condition. ISBN: 9783540618829 Sprache: Englisch Gewicht in Gramm: 576 17,1 x 1,9 x 24,8 cm, hardcover.

Zustand: New. pp. viii + 300.

Broschiert. Zustand: Sehr gut. Lecture Notes in Artificial Intelligence, Band 2083. Zust: Gutes Exemplar. Mit Vorbesitzereintrag. XV, 708 Seiten, Englisch 1030g.

2004th ed. 17 x 24 cm. 352 pages. Hardcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Sprache: Englisch.

Paperback. Zustand: Brand New. 1997 edition. 348 pages. 9.00x6.00x0.75 inches. In Stock.

Zustand: New.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The History of the Book In August 1992 the author had the opportunity to give a course on resolution theorem proving at the Summer School for Logic, Language, and Information in Essex. The challenge of this course (a total of five two-hour lectures) con sisted in the selection of the topics to be presented. Clearly the first selection has already been made by calling the course 'resolution theorem proving' instead of 'automated deduction' . In the latter discipline a remarkable body of knowledge has been created during the last 35 years, which hardly can be presented exhaustively, deeply and uniformly at the same time. In this situ ation one has to make a choice between a survey and a detailed presentation with a more limited scope. The author decided for the second alternative, but does not suggest that the other is less valuable. Today resolution is only one among several calculi in computational logic and automated reasoning. How ever, this does not imply that resolution is no longer up to date or its potential exhausted. Indeed the loss of the 'monopoly' is compensated by new appli cations and new points of view. It was the purpose of the course mentioned above to present such new developments of resolution theory. Thus besides the traditional topics of completeness of refinements and redundancy, aspects of termination (resolution decision procedures) and of complexity are treated on an equal basis.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Third Kurt G|del Symposium, KGC'93, held in Brno, CzechRepublic, August1993, is the third in a series of biennialsymposia on logic, theoretical computer science, andphilosophy of mathematics. The aim of this meeting wastobring together researchers working in the fields ofcomputational logic and proof theory. While proof theorytraditionally is a discipline of mathematical logic, thecentral activity in computational logic can be foundincomputer science. In both disciplines methods were inventedwhich arecrucial to one another. This volume contains theproceedings of the symposium. It contains contributions by36 authors from 10 different countries. In addition to 10invited papers there are 26 contributed papers selected fromover 50 submissions.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory, KGC '97, held in Vienna, Austria, in August 1997.The volume presents 20 revised full papers selected from 38 submitted papers. Also included are seven invited contributions by leading experts in the area. The book documents interdisciplinary work done in the area of computer science and mathematical logics by combining research on provability, analysis of proofs, proof search, and complexity.

Taschenbuch. Zustand: Neu. Computational Logic and Proof Theory | 5th Kurt Gödel Colloquium, KGC'97, Vienna, Austria, August 25-29, 1997, Proceedings | Georg Gottlob (u. a.) | Taschenbuch | ix | Englisch | 1997 | Springer Spektrum | EAN 9783540633853 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Computational Logic and Proof Theory | Third Kurt Gödel Colloquium, KGC'93, Brno, Czech Republic, August 24-27, 1993. Proceedings | Georg Gottlob (u. a.) | Taschenbuch | xi | Englisch | 1993 | Springer Spektrum | EAN 9783540571841 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. pp. 360 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher.

Zustand: New. pp. 728 Illus.

Taschenbuch. Zustand: Neu. Methods of Cut-Elimination | Alexander Leitsch (u. a.) | Taschenbuch | vi | Englisch | 2013 | Springer | EAN 9789400734975 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. Neuware -associated workshops and produced their own separate proceedings.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 728 pp. Englisch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The last ten years have seen a gradual fragmentation of the Automated Reas- ing community into various disparate groups, each with its own conference: the Conference on Automated Reasoning (CADE), the International Workshop on First-Order Theorem Proving (FTP), and the International Conference on - tomated Reasoning with Analytic Tableau and Related Methods (TABLEAUX) to name three. During 1999, various members of these three communities d- cussed the idea of holding a joint conference in 2001 to bring our communities togetheragain.Theplanwastoholdaone-o conferencefor2001,toberepeated ifitprovedasuccess.Thisvolumecontainsthepaperspresentedattheresulting event:the rstInternationalJointConferenceonAutomatedReasoning(IJCAR 2001), held in Siena, Italy, from June 18 23, 2001. We received 88 research papers and 24 systems descriptions as submissions. Each submission was fully refereed by at least three peers who were asked to writeareportonthequalityofthesubmissions.Thesereportswereaccessibleto membersoftheprogrammecommitteeviaaweb-basedsystemspeciallydesigned for electronic discussions. As a result we accepted 37 research papers and 19 system descriptions, which make up these proceedings. In addition, this volume contains full papers or extended abstracts from the ve invited speakers. Tenone-dayworkshopsandfourtutorialswereheldduringIJCAR2001.The automatedtheoremprovingsystemcompetition(CASC)wasorganizedbyGeo Sutcli e to evaluate the performance of sound, fully automatic, classical, r- order automated theorem proving systems. The third Workshop on Inference in Computational Semantics (ICoS-3) and the 9th Symposium on the Integration of Symbolic Computation and Mechanized Reasoning (CALCULEMUS-2001) were co-located with IJCAR 2001, and held their own associated workshops and produced their own separate proceedings.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs with only atomic cuts (atomic cut normal forms, so-called ACNFs). The first part investigates traditional reductive methods from the point of view of proof rewriting. Within this general framework, generalizations of Gentzen's and Sch'utte-Tait's cut-elimination methods are defined and shown terminating with ACNFs of the original proof. Moreover, a complexity theoretic comparison of Gentzen's and Tait's methods is given.The core of the book centers around the cut-elimination method CERES (cut elimination by resolution) developed by the authors. CERES is based on the resolution calculus and radically differs from the reductive cut-elimination methods. The book shows that CERES asymptotically outperforms all reductive methods based on Gentzen's cut-reduction rules. It obtains this result by heavy use of subsumption theorems in clause logic. Moreover, several applications of CERES are given (to interpolation, complexity analysis of cut-elimination, generalization of proofs, and to the analysis of real mathematical proofs). Lastly, the book demonstrates that CERES can be extended to nonclassical logics, in particular to finitely-valued logics and to G'odel logic.

Gebunden. Zustand: New. 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 buildi.