Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Computing in Horn clause theories / Peter Padawitz.

By: Material type: TextTextSeries: EATCS monographs on theoretical computer science ; v 16.Publication details: Berlin : Springer-Verlag, ©1988.Description: xi, 322 p. : ill. ; 26 cmISBN:
  • 0387194274
Subject(s): DDC classification:
  • 005.11 23 P123
Contents:
1. Introduction-- 2. Basic notions-- 3. Sample specifications-- 4. Models and theories-- 5. Resolution and paramodulation-- 6. The relevance of constructors-- 7. Reduction-- 8. Narrowing-- 9. Church-Rosser criteria-- References-- Indexes.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Status Date due Barcode Item holds
Books ISI Library, Kolkata 511.3 P123 (Browse shelf(Opens below)) Available C26373
Total holds: 0

Includes indexes.

Bibliography: p. [307]-316.

1. Introduction--
2. Basic notions--
3. Sample specifications--
4. Models and theories--
5. Resolution and paramodulation--
6. The relevance of constructors--
7. Reduction--
8. Narrowing--
9. Church-Rosser criteria--
References--
Indexes.

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.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in