Home  - Basic_P - Prolog Programming

Books Baby Camera Phones Computers Games DVD Electronics Kitchen Magazines Music Garden Software Tools Toys Video Apparel & Accessories Jewelry & Watches Musical Instruments Health & Personal Care Beauty Sports & Outdoors Office Products

e99.com Bookstore

Images

Newsgroups

121-125 of 125    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Prolog Programming:     more books (100)

Prolog (International Computer Science Series) Using Turbo Prolog (Borland-Osborne/McGraw-Hill Business) by Kelly Rich, Phillip R. Robinson, 1988-10 PROLOG Wizard: A Wiley Programmer's Reference by Dennis L. Foster, 1987-07 Turbo Prolog: Step by Step : With Turbo Prolog 2.0 by Ralph Cafolla, Daniel Albert Kauffman, 1989-02 Prolog, Programming Problem Solving With Prolog by John Stobo, 1989-12-31 Turbo PROLOG: Advanced Programming Techniques by Safaa H. Hashim, Philip C. Seyer, 1989-11-01 PROLOG: Programming for Tomorrow by Jim Doores, Allan Reiblein, et all 1987-04 Prolog Programming: A Tutorial Introduction (Artificial Intelligence Texts) by Carlton McDonald, Masoud Yazdani, 1991-01 PROLOG Through Examples: A Practical Programming Guide by Igor Kononenko, N. Lavrac, 1988-06-01 Concurrent Prolog - Vol. 1: Collected Papers (Logic Programming) Prolog Programming in Depth - 1996 publication by Andr Vllno, 1996-01-01 Prolog: Programming for Artificial Intelligence -- Second 2nd Edition by Ivan Bratko, 1994 Expert Systems Programming in Turbo Prolog by Daniel H. Marcellus, 1988-10

lists with details

121. Cetus Links: 18,452 Links On Objects And Components / Prolog
     ObjectOriented Language prolog. Intro. prolog is a goal-oriented, implicative language based on predicate logic. Goal-oriented means that a program proceeds by attempting to achieve a goal which is  
     http://www.cetus-links.org/oo_prolog.html
     
     Extractions: Prolog is a goal-oriented, implicative language based on predicate logic. Goal-oriented means that a program proceeds by attempting to achieve a goal which is itself defined by other goals. Prolog operates in an inferential or implicative way: What you write are implications, and operation flows from one impliction to the next implied goal. A line of Prolog code is generally either a rule or a fact - code and data being largely interchangable. Prolog code often has a declarative interpretation, meaning that it specifies "what" exists but not "how." This is different from imperative in which a program defines a series of steps to carry out (C or Basic for example). PROLOG means PROgramming in LOGic. Implications are specified in the form of logical predicates called Horn clauses. A horn clause consists of a sought implication (a goal clause), and a set of clauses that must be be proven separated by . which simply means "if." A typical Prolog statement has the form: goalclause(V g clause (V ),..,clause

122. The XSB System
     The XSB programming System (Version 2.2 ). Dept. of Computer Science SUNY at Stony Brook In collaboration with Katholieke Universiteit  
     http://www.cs.sunysb.edu/~sbprolog/xsb-page.html
     
     Extractions: The FLORA (an XSB-based F-logic compiler) manual: Other Documentation Acknowledgement of Support For further information about our group, see the XSB Research Group homepage . If you'd like to know more about XSB, or if you have any suggestions, send email to xsb-contact@cs.sunysb.edu If you have any problems with this page, please send us mail. Email: xsb-contact@cs.sunysb.edu $Date: 2000/04/20 21:12:34 $

123. Modular Termination Proofs For Logic And Pure Prolog Programs
     of the methods of Bezem Bez first published as Bez and of Apt and Pedreschi AP first published as AP for proving termination of logic and prolog programs.  
     http://citeseer.ist.psu.edu/apt93modular.html

124. CG: 9 A Simple Prolog Program
     9 A simple prolog program. Students and their semesters. Now we combine this knowledge into a small, complete program. Consider the following prolog program  
     http://www.huminf.aau.dk/cg/Module_II/1030.html
     
     Extractions: Part VI: Reference We have looked at what a term is. We have seen four of the six kinds of terms. Now we combine this knowledge into a small, complete program. Consider the following Prolog program: student(Lisa, 5). student(Martin, 3). student(John, 3). student(Edward, 7). It is available as the file "Students1.plgCG" in the AAU sample directory. The program consists of four facts , each of which consists of a structure and a period ("."). Each structure denotes a relationship between a student's name and the semester at which the student is studying. Thus Lisa is in the fifth semester, while Martin is in the third, etc. We will reprint this sample program on subsequent pages when necessary. PrevLite: 8.6 Quiz: Terms

125. PC AI - Artificial Intelligence
     Where Intelligent Technology Meets the Real World, The PC AI Home Page has moved. PC AI Magazine PO Box 30130 Phoenix, AZ 85046 Voice  
     http://www.pcai.com/pcai/New_Home_Page/ai_info/pcai_prolog.html

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

121-125 of 125    Back | 1  | 2  | 3  | 4  | 5  | 6  | 7