×


 x 

Shopping cart
Peter Padawitz - Computing in Horn Clause Theories - 9783642738265 - V9783642738265
Stock image for illustration purposes only - book cover, edition or condition may vary.

Computing in Horn Clause Theories

€ 67.84
FREE Delivery in Ireland
Description for Computing in Horn Clause Theories Paperback. Series: Monographs in Theoretical Computer Science : An Eatcs Series. Num Pages: 333 pages, 1 black & white illustrations, biography. BIC Classification: UMX; UMZ; UYA; UYZG. Category: (P) Professional & Vocational. Dimension: 244 x 170 x 18. Weight in Grams: 587.
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 ... Read more

Product Details

Format
Paperback
Publication date
2011
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG Germany
Number of pages
333
Condition
New
Series
Monographs in Theoretical Computer Science : An Eatcs Series
Number of Pages
322
Place of Publication
Berlin, Germany
ISBN
9783642738265
SKU
V9783642738265
Shipping Time
Usually ships in 15 to 20 working days
Ref
99-15

Reviews for Computing in Horn Clause Theories

Goodreads reviews for Computing in Horn Clause Theories


Subscribe to our newsletter

News on special offers, signed editions & more!