Verwandte Artikel zu Computing in Horn Clause Theories
Reseña del editor
At least four research fields detennine the theoretical background of specification and deduction in computer science: recursion theory, automated theorem proving, abstract data types and tenn rewriting systems. As these areas approach each other more and more, the strong distinctions between functional and relational views, deductive and denotational approaches as well as between specification and programming are relieved in favour of their integration. The book will not expose the lines of this development; conversely, it starts out from the nucleus of Hom clause logic and brings forth both known and unknown results, most of which affect more than one of the fields mentioned above. Chapter 1 touches on historical issues of specification and prototyping and delimits the topics handled in this book from others which are at the core of related work. Chapter 2 provides the fundamental notions and notations needed for the presentation and interpretation of many-sorted Horn clause theories with equality. Chapter 3 supplies a number of sample Hom clause specifications ranging from arithmetic through string manipulation to higher data structures and interpreters of programming languages. Some of these examples serve as a reference to illustrate definitions and results, others may throw a light on the strong link between specifications and programs, which are executed by applying deduction rules. Thus we have included examples of how to use program trans/ormation methods in specification design.
Reseña del editor
This book presents a unifying approach to semantical concepts and deductive methods used in recursive, equational and logic programming, data type specification and automated theorem-proving. The common background is Horn logic with equality. Although this logic does not cover the full first-order logic, it supplies us with a language that allows "natural" problem specifications, offers several semantical views (functional, relational, inductive, behavioural, etc.) and puts at our disposal a number of more or less special-purpose deductive methods, which can be used as rapid prototyping tools. The Horn clause calculus serves as the interface between the model-theoretic concepts of initial semantics, final semantics and internalized logic on one hand and deductive methods based on resolution, paramodulation, reduction and narrowing on the other hand. This contrasts previous approaches, which equip each semantical concept with its own calculus or, conversely, build a particular semantics upon each deductive method. Here the author starts out from the Horn clause calculus and develops individual concepts, results and procedures in a way that clearly delimits their respective purposes from each other. The unifying approach also brings about new variants or generalizations of known results and admits comparable arguments in soundness and completeness proofs.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Weitere beliebte Ausgaben desselben Titels
Suchergebnisse für Computing in Horn Clause Theories
Beispielbild für diese ISBN
Computing in Horn Clause Theories
Anbieter: Buchpark, Trebbin, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher. Artikel-Nr. 653301/202
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Computing in Horn Clause Theories
Verlag:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1988
ISBN 10: 3540194274
ISBN 13: 9783540194279
Gebraucht
Hardcover
Anbieter: Ammareal, Morangis, Frankreich
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Bon. Ancien livre de bibliothèque avec équipements. Edition 1988. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Edition 1988. Ammareal gives back up to 15% of this item's net price to charity organizations. Artikel-Nr. G-128-599
Anzahl: 1 verfügbar
Foto des Verkäufers
Computing in Horn Clause Theories (Monographs in Theoretical Computer Science. An EATCS Series)
Anbieter: NEPO UG, Rüsselsheim am Main, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Gebundene Ausgabe. Zustand: Sehr gut. 322 Seiten Exemplar aus einer wissenchaftlichen Bibliothek Sprache: Englisch Gewicht in Gramm: 969. Artikel-Nr. 384455
Anzahl: 1 verfügbar