2003 | Hardback | 592 pages | ISBN: 0-521-75374-0
This two-volume work bridges the gap between introductory
expositions of logic or set theory on one hand, and the research
literature on the other. It can be used as a text in an advanced
undergraduate or beginning graduate course in mathematics,
computer science, or philosophy. The volumes are written in a
user-friendly conversational lecture style that makes them
equally effective for self-study or class use. Volume II, on
formal (ZFC) set theory, incorporates a self-contained ‘chapter
0’ on proof techniques so that it is based on formal logic, in
the style of Bourbaki. The emphasis on basic techniques will
provide the reader with a solid foundation in set theory and
provides a context for the presentation of advanced topics such
as absoluteness, relative consistency results, two expositions of
Godel’s constructible universe, numerous ways of viewing
recursion, and a chapter on Cohen forcing.
Contents
1. At the beginning; 2. The axioms of set theory; 3. The axiom of
choice; 4. The natural numbers; transitive closure; 5. Order; 6.
Cardinality.
January 2003 | Hardback | 570 pages 14 tables 53 figures |
ISBN: 0-521-78176-0
Description Logics are a family of knowledge representation
languages that have been studied extensively in Artificial
Intelligence over the last two decades. They are embodied in
several knowledge-based systems and are used to develop various
real-life applications. The Description Logic Handbook provides a
thorough account of the subject, covering all aspects of research
in this field, namely: theory, implementation, and applications.
Its appeal will be broad, ranging from more theoretically-oriented
readers, to those with more practically-oriented interests who
need a sound and modern understanding of knowledge representation
systems based on Description Logics. The chapters are written by
some of the most prominent researchers in the field, introducing
the basic technical material before taking the reader to the
current state of the subject, and including comprehensive guides
to the literature. In sum, the book will serve as a unique
reference for the subject, and can also be used for self-study or
in conjunction with Knowledge Representation and Artificial
Intelligence courses.
Contributors
D. Nardi, R. J. Brachman, F. Baader, W. Nutt, F. M. Donini, U.
Sattler, D. Calvanese, R. Molitor, G. De Giacomo, R. Kusters, F.
Wolter, D. L. McGuinness, P. F. Patel-Schneider, R. Moller, V.
Haarslev, I. Horrocks, A. Borgida, C. Welty, A. Rector, E.
Franconi, M. Lenzerini, R. Rosati
Contents
1. An introduction to description logics D. Nardi and R. J.
Brachman; Part I. Theory: 2. Basic description logics F. Baader
and W. Nutt; 3. Complexity of reasoning F. M. Donini; 4.
Relationships with other formalisms U. Sattler, D. Calvanese and
R. Molitor; 5. Expressive description logics D. Calvanese and G.
De Giacomo; 6. Extensions to description logics F. Baader, R.
Kusters and F. Wolter; Part II. Implementation: 7. From
description logic provers to knowledge representation systems D.
L. McGuinness and P. F. Patel-Schneider; 8. Description logics
systems R. Moller and V. Haarslev; 9. Implementation and
optimisation techniques I. Horrocks; Part III. Applications: 10.
Conceptual modeling with description logics A. Borgida and R. J.
Brachman; 11. Software engineering C. Welty; 12. Configuration D.
L. McGuinness; 13. Medical informatics A. Rector; 14. Digital
libraries and web-based information systems I. Horrocks, D. L.
McGuinness and C. Welty; 15. Natural language processing E.
Franconi; 16. Description logics for data bases A. Borgida, M.
Lenzerini and R. Rosati; Appendix. Description logic terminology
F. Baader; Bibliography.
January 2003 | Hardback | 470 pages | ISBN: 0-521-81802-8
Knowledge management and knowledge-based intelligence are areas
of importance in today’s economy and society, and to exploit
them fully and efficiently it is necessary both to represent and
reason about knowledge via a declarative interface whose input
language is based on logic. In this book, Chitta Baral shows
exactly how to go about doing that: how to write programs that
behave intelligently by giving them the ability to express
knowledge and reason about it. He presents a language, AnsProlog,
for both knowledge representation and reasoning, and declarative
problem solving. Many of the results here have never appeared
before in book form, and they have been organised here into a
form that will appeal to practising and would-be knowledge
engineers wishing to learn more about the subject, either in
courses or through self-teaching. A comprehensive bibliography
rounds off the book.
Contents
Preface; 1. Declarative programming in AnsProlog*: introduction
and preliminaries; 2. Simple modules for declarative programming
with answer sets; 3. Principles and properties of declarative
programming with answer sets; 4. Declarative problem solving and
reasoning in AnsProlog*; 5. Reasoning about actions and planning
in AnsProlog*; 6. Complexity, expressiveness and other properties
of AnsProlog* programs; 7. Answer set computing algorithms; 8.
Query answering and answer set computing systems; 9. Further
extensions of and alternatives to AnsProlog*; 10. Appendix A:
Ordinals, lattices and fixpoint theory; 11. Appendix B: Turing
machines.
2003 | Hardback | 800 pages 29 tables 563 exercises 49 figures
54 colour figures | ISBN: 0-521-82646-2
Not yet published - available from March 2003 | Stock level
updated: 26 Dec 04:59GMT
Computer algebra systems are gaining importance in all areas of
science and engineering. This textbook gives a thorough
introduction to the algorithmic basis of the mathematical engine
in computer algebra systems. It is designed to accompany one- or
two-semester courses for advanced undergraduate or graduate
students in computer science or mathematics. Its
comprehensiveness and authority also make it an essential
reference for professionals in the area. Special features include:
detailed study of algorithms including time analysis;
implementation reports on several topics; complete proofs of the
mathematical underpinnings; a wide variety of applications (among
others, in chemistry, coding theory, cryptography, computational
logic, and the design of calendars and musical scales). Some of
this material has never appeared before in book form. For the new
edition, errors have been corrected, the text has been smoothed
and updated, and new sections on greatest common divisors and
symbolic integration have been added.
Contents
Introduction; 1. Cyclohexane, cryptography, codes and computer
algebra; Part I. Euclid: 2. Fundamental algorithms; 3. The
Euclidean algorithm; 4. Applications of the Euclidean algorithm;
5. Modular algorithms and interpolation; 6. The resultant and gcd
computation; 7. Application: Decoding BCH codes; Part II. Newton:
8. Fast multiplication; 9. Newton iteration; 10. Fast polynomial
evaluation and interpolation; 11. Fast Euclidean algorithm; 12.
Fast linear algebra; 13. Fourier transform and image compression;
Part III. Gauss: 14. Factoring polynomials over finite fields; 15.
Hensel lifting and factoring polynomials; 16. Short vectors in
lattices; 17. Applications of basis reduction; Part IV. Fermat:
18. Primality testing; 19. Factoring integers; 20. Application:
Public key cryptography; Part V. Hilbert: 21. Grobner bases; 22.
Symbolic integration; 23. Symbolic summation; 24. Applications;
Appendix: 25. Fundamental concepts; Sources of illustrations;
Sources of quotations; List of algorithms; List of figures and
tables; References; List of notation; Index.