ShopSpell

PROLOG for Computer Science [Paperback]

$42.99     $54.99    22% Off      (Free Shipping)
100 available
  • Category: Books (Computers)
  • Author:  Dawe, Christopher
  • Author:  Dawe, Christopher
  • ISBN-10:  3540198113
  • ISBN-10:  3540198113
  • ISBN-13:  9783540198116
  • ISBN-13:  9783540198116
  • Publisher:  Springer
  • Publisher:  Springer
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Feb-1994
  • Pub Date:  01-Feb-1994
  • SKU:  3540198113-11-SPRI
  • SKU:  3540198113-11-SPRI
  • Item ID: 100850747
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jul 03 to Jul 05
  • Notes: Brand New Book. Order Now.
Prolog is important as one of the major programming languages. Beginning with a chapter on logic (which makes the book particularly useful to undergraduate students), Prolog for Computer Science provides a comprehensive tutorial that assumes no prior knowledge of programming. There are lots of realistic examples and case-studies, including an English-Dutch translator.Prolog is important as one of the major programming languages. Beginning with a chapter on logic (which makes the book particularly useful to undergraduate students), Prolog for Computer Science provides a comprehensive tutorial that assumes no prior knowledge of programming. There are lots of realistic examples and case-studies, including an English-Dutch translator.1 Prolog.- 1.1 Why Learn Prolog?.- 1.2 Why Use this book?.- 1.3 Prolog.- 1.4 Limitations of Prolog.- 1.5 Past, Present and Future.- 1.6 Accessibility.- 2 Logic.- 2.1 Introduction.- 2.2 Traditional Logic.- 2.3 Symbolic Logic.- 2.4 Predicate Logic.- 2.5 Deductive Systems in the Real World.- 3 Logic Programming.- 3.1 Predicate Logic for Prolog.- 3.2 Clauses in Predicate Logic.- 3.3 Resolution.- 3.4 Computation Rules.- 4 Prolog Syntax.- 4.1 Entering Statements at Prologs Command Line.- 4.2 Using a Text Editor to Write a Program.- 4.3 Comments.- 4.4 Terms.- 4.5 Predicates.- 4.6 Clauses.- 4.7 Variables.- 4.8 Logical Connectives.- 4.9 Rules.- 4.10 Empty Heads.- 4.11 Making Queries.- 4.12 Built-in Predicates.- 4.13 Operators.- 4.14 Declaring an Operator.- 4.15 Blank Variables.- 4.16 Equality.- 4.17 Recursion.- 4.18 Updating a Running Program.- 4.19 Lists.- 4.20 Applications.- 5 Goal Searching and Its Control.- 5.1 Goals.- 5.2 Search Control.- 5.3 Extra Search Control Predicates.- 6 Arithmetic and Mathematics.- 6.1 Introduction.- 6.2 Arithmetic Predicates.- 6.3 Programs Using Arithmetic Predicates.- 6.4 Mathematical Functions.- 6.5 Mathematical Operations.- 6.6 Application.- 7 Input and Output PrelÎ
Add Review