Deduction Systems

R. Socher-Ambrosius, P. Johann (Autoren)

Buch | Hardcover

218 Seiten

1996 | 1997 ed.
Springer-Verlag New York Inc.
978-0-387-94847-8 (ISBN)

Titel ist leider vergriffen;
keine Neuauflage

Artikel merken

Offering a theoretical treatment of the fundamental concepts and methods of automated deduction, this text presents an account which covers resolution theorem-proving in order-sorted first-order logic. Gentzen-style sequent calculi and the refutation method known as resolution are covered.

This graduate-level text offers a theoretical treatment of the fundamental concepts and methods of automated deduction. By presenting an account which covers resolution theorem-proving in order-sorted first-order logic it provides a self-contained account suitable for students coming to the subject for the first time. Both Gentzen-style sequent calculi and the refutation method known as resolution are treated in detail. Various strategies for pruning resolution search spaces, such as linear, hyper- and ordered resolution are covered. Numerous examples are presented to illustrate the examples discussed. As a result students will find this a readily accessible introduction to this subject.

Contents: Mathematical Preliminaries; Syntax of first-order languages; Semantics of first-order languages; The Gentzen calculus G. Normal Forms and Herbrand's Theorem; Resolution and unification; Improved Deduction efficiency; Resolution in sorted logic.

Reihe/Serie	Graduate Texts in Computer Science
Zusatzinfo	34fig.
Verlagsort	New York, NY
Sprache	englisch
Einbandart	gebunden
Themenwelt	Informatik ► Theorie / Studium ► Künstliche Intelligenz / Robotik
ISBN-10	0-387-94847-3 / 0387948473
ISBN-13	978-0-387-94847-8 / 9780387948478
Zustand	Neuware