The Resolution Calculus / Texts in Theoretical Computer Science. An EATCS Series (PDF)
(Sprache: Englisch)
This is a completely new presentation of resolution as a logical calculus and as a basis for computational algorithms and decision procedures.
The first part deals with the traditional topics (Herbrand's theorem, completeness of resolution, refinements and...
The first part deals with the traditional topics (Herbrand's theorem, completeness of resolution, refinements and...
sofort als Download lieferbar
eBook (pdf)
53.49 €
26 DeutschlandCard Punkte
sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „The Resolution Calculus / Texts in Theoretical Computer Science. An EATCS Series (PDF)“
This is a completely new presentation of resolution as a logical calculus and as a basis for computational algorithms and decision procedures.
The first part deals with the traditional topics (Herbrand's theorem, completeness of resolution, refinements and deletion) but with many new features and concepts like normalization of clauses, resolution operators, and search complexity.
Building on this foundation, the second part gives a systematic treatment of recent research topics. It is shown how resolution decision procedures can be applied to solve the decision problem for some important first-order classes. The complexity of resolution is analyzed in terms of Herbrand complexity, and new concepts like ground projection are used to classify the complexity of refinements. Finally, the method of functional extension is introduced; combined with resolution it gives a computational calculus which is stronger than most others.
The first part deals with the traditional topics (Herbrand's theorem, completeness of resolution, refinements and deletion) but with many new features and concepts like normalization of clauses, resolution operators, and search complexity.
Building on this foundation, the second part gives a systematic treatment of recent research topics. It is shown how resolution decision procedures can be applied to solve the decision problem for some important first-order classes. The complexity of resolution is analyzed in terms of Herbrand complexity, and new concepts like ground projection are used to classify the complexity of refinements. Finally, the method of functional extension is introduced; combined with resolution it gives a computational calculus which is stronger than most others.
Bibliographische Angaben
- Autor: Alexander Leitsch
- 2012, 1997, 300 Seiten, Englisch
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 3642606059
- ISBN-13: 9783642606052
- Erscheinungsdatum: 06.12.2012
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Größe: 25 MB
- Ohne Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kommentar zu "The Resolution Calculus / Texts in Theoretical Computer Science. An EATCS Series"
0 Gebrauchte Artikel zu „The Resolution Calculus / Texts in Theoretical Computer Science. An EATCS Series“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "The Resolution Calculus / Texts in Theoretical Computer Science. An EATCS Series".
Kommentar verfassen