21. Prolog--Programming - Addison Wesley / Benjamin Cummings Catalog prolog programming for Artificial Intelligence, 3/E Ivan Bratko, Universityof Ljubljana © 2001 / 0201-40375-7 / Addison-Wesley. PrologProgramming. http://www.aw.com/catalog/academic/course/1,4095,69989,00.html

Find Your Rep Publish with Us Customer Service Careers ... Statistics Sort by: Author Title Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers Leslie Lamport / 0-321-14306-X / Addison Wesley Professional PROLOG Programming for Artificial Intelligence, 3/E Ivan Bratko, University of Ljubljana / 0-201-40375-7 / Addison-Wesley PrologProgramming Featured Titles Need to know what support is materials are available for a particular book? Click here Find out how your students can get the latest compilers Find out how your students can get the Oracle 9i Personal Edition Visit InformIT , an online resource center that delivers premium IT content, access to industry experts, training courses, and news. InformIT provides authoritative solutions in key topic areas for techies of all skill levels. Interested in reviewing a textbook? Click here Interested in publishing with us? Click here To e-mail Computing, write to computing@aw.com AW Higher Education Group , a division of Pearson Education , a Pearson . E-mail webmaster@awl.com

22. PROLOG Programming For Artificial Intelligence, 3/E - Addison Wesley / Benjamin RELATED TITLES. Artificial Intelligence (AI) (Computer Science). PrologProgramming(Computer Science). prolog programming for Artificial Intelligence, 3/E. http://www.aw.com/catalog/academic/product/1,4096,0201403757,00.html

Find Your Rep Publish with Us Customer Service Careers ... Statistics ABOUT THIS PRODUCT Description Table of Contents Features Appropriate Courses RELATED TITLES Artificial Intelligence (AI) (Computer Science) PrologProgramming (Computer Science) PROLOG Programming for Artificial Intelligence, 3/E View Larger Image Ivan Bratko University of Ljubljana ISBN: 0-201-40375-7 Publisher: Addison-Wesley Format: Paper; 678 pp Published: 09/08/2000 Status: Instock US: $61.00 You Save: $6.10 (10% off) Our Price: $54.90 Add to Cart Instructor Exam Copy Description This best-selling guide to Prolog has been fully revised and extended to provide an even greater range of applications, enhancing its value as a stand-alone guide to Prolog, Artificial Intelligence, or AI Programming for students and professional programmers alike. Ivan Bratko discusses natural language processing with grammar rules, planning, and machine learning. The coverage of meta-programming includes meta-interpreters and object-oriented programming in Prolog. The new edition includes coverage of: constraint logic programming; qualitative reasoning; inductive logic programming; recently developed algorithms; belief networks for handling uncertainty; and a major update on machine learning.

23. Ctl270 Prolog Programming på svenska suomeksi. prolog programming CTL270 (2 credits) Spring 2002.Course Syllabus. This handson course teaches the prolog programming http://www.ling.helsinki.fi/kit/2002k/ctl270/

på svenska suomeksi Prolog Programming CTL270 (2 credits) Spring 2002 Course Syllabus This hands-on course teaches the Prolog programming language from the perspective of computational linguistics. Students learn the key concepts and techniques of logic programming, including Prolog database queries, Prolog term unification, backtracking and recursion. These techniques are then applied to natural language processing, including linguistic feature unification and elementary parsing with Definite Clause Grammars (DCGs). The software used is SICStus Prolog. The course textbooks are: Programming in Prolog , Springer Verlag, 1981-1994 and Prolog and Natural Language Analysis , CSLI Publications, Stanford, 1987. The course is taught in English. The course consists of lectures and practical lab sessions. Prerequisites Knowledge of Unix (equivalent to Ctl130) Knowledge of Emacs (equivalent to Chapters 1-5 of Learning GNU Emacs , O'Reilly, 1996) Introductory knowledge of programming (equivalent to Ctl220) The course is suitable for language students who do not have a computer science background.

24. Ctl272 Prolog Programming prolog programming CTL272 (2 credits) Spring 2003. Course Syllabus. Thiscourse gives a practical introduction to programming in Prolog. http://www.ling.helsinki.fi/kit/2003k/ctl272/

Prolog Programming CTL272 (2 credits) Spring 2003 Course Syllabus This course gives a practical introduction to programming in Prolog. Students learn the key concepts and techniques of Prolog and logic programming, including Prolog database queries, term unification, recursion, list processing, backtracking and negation. These techniques are illustrated with examples from artificial intelligence and natural language processing, including elementary expert systems and basic parsing with Definite Clause Grammars. The course is taught in English. The course consists of lectures, practical lab exercises, and a series of programming assignments. Prerequisites Knowledge of Unix (equivalent to Ctl130) Knowledge of Emacs (equivalent to Chapters 1-5 of Learning GNU Emacs , O'Reilly, 1996) Introductory knowledge of programming (equivalent to Ctl220) The course is suitable for language students who do not have a computer science background. Course arrangements Time: Thursdays 13-16, 16.01.03 - 27.02.03

25. Sample: Prolog: Programming In Logic prolog programming in Logic. Introduction. intro.prolog sum.html 320w14.html Notes on Sebesta Chapter 15 Logic Programming. 15.html Laboratories. http://www.csci.csusb.edu/dick/samples/prolog.html

CSUSB CompSci Dick Botting Samples ... Notation Mon May 6 12:53:56 PDT 2002 Contents Prolog: Programming in Logic : Introduction : Notes on Sebesta Chapter 15: Logic Programming : Laboratories ... Index of defined terms etc. Prolog: Programming in Logic Introduction intro.prolog sum.html 320w14.html Notes on Sebesta Chapter 15: Logic Programming 15.html Laboratories Fast Overview ): Intriguing Prolog Examples and puzzles: [ 10.html Elements lab1.html Definitions lab2.html DIY ): Do It Yourself [ lab3.html Documentation prolog.summary.html prolog.predicates.html expressions prolog.glossary.html ... prolog.FAQ Specifications prolog.semantics.html prolog.syntax.html Examples http://www.csci.csusb.edu/dick/cs320/prolog/ Other Local resources prolog.www.sites.html prolog.mbox prolog.news prolog.FAQ ... prolog.mbox Compiler/Interpreters At CSci.CSUSB we have two systems available. SWI-Prolog [ http://www.swi.psy.uva.nl/projects/SWI-Prolog/ ] and the local copies that can generate a prolog system for most UNIXen, and also DOS and Windows nnn systems: [ src Gnu Prolog Manuals: [ http://www.csci.csusb.edu/dick/cs320/prolog/gprolog/

26. OOPWeb.com - Prolog Directory - Tutorials, References, Guides... prolog programming tutorial and online book. http://www.oopweb.com/Prolog/Files/Prolog.html

Prolog programming tutorials, references, guides and online books. All of these are hosted locally at the Prolog Directory , enabling quick access and accurate search. Advanced Search Search Tips Prolog Directory Home Submit Document F.A.Q About ... Contact Information Title Author Description Tutorials Adventure In Prolog No Frames AMZI Complete Prolog book, covering the language extensively. The following topics are covered : Logic Programming , Jargon ,Facts, Simple Queries , How Queries Work ,Compound Queries ,Built-in Predicates ,Rules ,Arithmetic ,Managing Data ,Recursion, Pragmatics , Data Structures ,Unification , Lists ,Operators , Cut ,Control Structures ,Recursive Control Loop ,Tail Recursion ,Natural Language ,Difference Lists , Natural Language Front End , Definite Clause Grammar , Reading Sentences , Exercises ,Appendix Building Expert Systems In Prolog No Frames AMZI This book is designed to teach you how to build expert systems from the inside out. It presents the various features used in expert systems, shows how to implement them in Prolog, and how to use them to solve problems. The code presented in this book is a foundation from which many types of expert systems can be built. It can be modified and tuned for particular applications. It can be used for rapid prototyping. It can be used as an educational laboratory for experimenting with expert system concepts.

27. Citations: Prolog Programming For Artificial Intelligence - Bratko (ResearchInde prolog programming for Artificial Intelligence. AddisonWesley, 1986. I. Bratko, prolog programming for Artificial Intelligence, Addison-Wesley, 1990. http://citeseer.nj.nec.com/context/192857/0

107 citations found. Retrieving documents... I. Bratko, " Prolog Programming for Artificial Intelligence ," Addison-Wesley, 1990. Home/Search Document Not in Database Summary Related Articles Check This paper is cited in the following contexts: First 50 documents Next 50 Proxies + Path Prediction: Improving Web Service Provision .. - Wireless Mobile.. (Correct) ....N f ( and N s ( as shown in Table 2. 22 6. Simulation Results 6. 1 Simulation of the path prediction algorithm We have programmed the logic of the automaton based path prediction algorithm in Prolog, a 5 generation (declarative) programming language (5GL) widely used in AI applications Specifically, we have made use of the Arity Prolog interpreter environment [Ari92] The adoption of Prolog has enabled the very rapid prototyping of the automaton due to the easy implementation of a state transition matrix structure similar to one discussed before. Additionally , the declarative .... I. Bratko, " Prolog Programming for Artificial Intelligence ," Addison-Wesley, 1990. Light propagation visualization as a tool for 3D scene.. - Kopylov, Dmitriev (2000)

28. Citations: Prolog Programming For Articial Intelligence - Bratko (ResearchIndex) (1986). prolog programming for Articial Intelligence. International Computer Science. PrologProgramming for Arti cial Intelligence. Addison Wesley, 1990. http://citeseer.nj.nec.com/context/1386327/0

8 citations found. Retrieving documents... I. Bratko. Prolog Programming for Articial Intelligence . Addison Wesley, 1990. 143 Home/Search Document Not in Database Summary Related Articles Check This paper is cited in the following contexts: Infinite RAAM: Initial Explorations into a Fractal Basis for.. - Levy (2002) (Correct) ....C ) we take the set of attractor points whose address is A, compute their left inverse , take the attractor points whose address is B, compute their right inverse, in Prolog terms have a natural interpretation as trees, with the functor at the root and the arguments in the branches (c. f , p. 33) Because the inverse transforms are expansive, we cannot simply compute the bijective inverse transfer function on this set of points, which would give us only a subset of the actual inverses. Instead , for a given point, we compute the set of points that go to that point on the given .... I. Bratko. Prolog Programming for Articial Intelligence . Addison Wesley, 1990. 143 Towards Concept-based Structuring of Electronic Scientific.. - Ragetli (2001) (Correct) ....hierarchy should be constructed by a human editor to guarantee high quality, the editor can get substantial support of automatic tools. In Section 4.4 we will further discuss this matter. 4.3.

29. Generation5.org - Prolog Programming For Artificial Intelligence prolog programming for Artificial Intelligence. Author Ivan Bratko.Title prolog programming for Artificial Intelligence. Rating http://www.generation5.org/ppfai.shtml

Home Essays Interviews Programs ... Search Search: Prolog Programming for Artificial Intelligence Author: Ivan Bratko Title: Prolog Programming for Artificial Intelligence Rating: Prolog has its roots in logic, however the main aim of this book is to teach PRolog as a practical programming tool. This text therefore concentrates on that art of using the basic mechanisms of Prolog to solove interesting prolbmes. - Excerpt from back cover Prolog is not an easy language to learn, therefore it must be even harder to teach! Prolog Programming for Artificial Intelligence tackles Prolog learning from an excellent perspective - applications to AI. This means though that the reader must be willing to dive head-first into things. The first chapter looks at things like recursive rules and how backtracking works while it introduces the user to the basics of Prolog. This can make the reading quite heavy going, not simple bedtime reading! Each section is well written, with clear and concise diagrams and example code. Each section also has exercises to help the reader gain further insight into the topics covered. At the end of each chapter, Bratko presents a summary of the concepts as well as follow-up references. The book is sensibly divided into two parts. Part I covers the language itself whereas Part II covers its applications to AI. Although Part I and Part II are quite separate, Part I still uses AI principles and problems throughout, such as tree building and the 8-Queens Problem. There is also a definite emphasis on the applications though since only 240 of the 700 pages are dedicated to the language itself.

30. LookSmart - Prolog Programming Resources Featured Sponsors. prolog programming Resources. LPA MacProlog32 Provides advancedAI programming and a Prolog compiler with the familiar Mac interface. http://www.looksmart.com/eus1/eus53832/eus155852/eus53906/eus65714/eus280256/r?l

31. Prolog Programming previous next contents top Prolog Miscellanea. References. minimizer.prl7K A very commented source code. Recursive Data Types in Prolog. http://okmij.org/ftp/Prolog/

previous next contents top Prolog Miscellanea Contents Solving Dr. Ecco's puzzle "Lines of Fire" Minimization of a Finite Automaton Recursive Data Types in Prolog Shortest Paths in a directed graph ... N-queen problem Minimization of a Finite Automaton A Prolog code that implements a Hopcroft-Ullman Algorithm 2.6 to minimize a Finite Automaton. Given a set of states, an initial and the final state(s), the alphabet and the transition function, the code returns a list of equivalent states. The equivalent states can then be merged, resulting in a smaller Finite State Machine. Version The current version is 1.0, October 1991. References minimizer.prl A very commented source code. Recursive Data Types in Prolog Ruminations on recursive data types in Prolog This simple code shows off two recursive data types (in ML notation) of natural numbers: and an operation plus of binary trees: Note that the latter declares a truly recursive type without ever resorting to pointers. The code then demonstrates how easy it is to implement both shallow and deep assignments of complex data (btrees) in Prolog. A sharing assignment semantics is already built into Prolog; it is efficient and safe as bound data are immutable. Yet a deep copy with possible modifications is just as easy to program.

32. SICStus Prolog - Programming Examples Programming Examples. Some simple examples of prolog programmingare given below. They exemplify typical applications of Prolog. http://www.sics.se/SICS-reports/SICS-T--93-01--SE/report_11.html

Go to the previous next section. Programming Examples Some simple examples of Prolog programming are given below. They exemplify typical applications of Prolog. We are trying to convey a flavor of Prolog programming style as well, by following the simple rules: Base case before recursive cases. Input arguments before output arguments. Use cuts sparingly, and only at proper places (see section The Cut Symbol ). A cut should be placed at the exact point that it is known that the current choice is the correct one: no sooner, no later. Use disjunctions sparingly, always put parentheses around them, never put parentheses around the individual disjuncts, never put the at the end of a line. The code herein was derived in part from shared code written by by R.A. O'Keefe. Simple List Processing The goal concatenate( is true if list consists of the elements of list concatenated with the elements of list . The goal member( X L is true if X is one of the elements of list L . The goal reverse( is true if list consists of the elements of list in reverse order.

33. SICStus Prolog - Programming Tips And Examples mention some important properties of the SICStus Prolog compiler. Anumber of simple examples of prolog programming are also given. http://www.sics.se/isl/sicstus/docs/3.7.1/html/sicstus_13.html

Go to the first previous next last section, table of contents Programming Tips and Examples This chapter describes how to write clean programs that will execute efficiently. To some extent, writing efficient code in any language requires basic knowledge of its compiler, and we will mention some important properties of the SICStus Prolog compiler. A number of simple examples of Prolog programming are also given. Programming Guidelines Indexing Tail If-Then-Else ... Programming Guidelines A lot of clarity and efficiency is gained by sticking to a few basic rules. This list is necessarily very incomplete. The reader is referred to textbooks such as [O'Keefe 90] for a thorough exposition of the elements of Prolog programming style and techniques. Don't write code in the first place if there is a library predicate that will do the job. Write clauses representing base case before clauses representing recursive cases. Input arguments before output arguments in clause heads and goals. Use pure data structures instead of data base changes. Use cuts sparingly, and

34. The 3rd Prolog Programming Contest The 3rd prolog programming Contest. The third Annual prolog programming Contesttook place in Bad Honnef (near Bonn) on September 2nd 1996 during JICSLP'96. http://www-lp.doc.ic.ac.uk/UserPages/staff/ft/alp/comment/contest3.html

The 3rd Prolog Programming Contest Appeared in Volume 10/1, February 1997 Keywords : competition. Bart Demoen The third Annual Prolog Programming Contest took place in Bad Honnef (near Bonn) on September 2nd 1996 during JICSLP'96. The conference organisers (thank you Univ. of Bonn, Rainer Manthey and Lutz Plumer) provided 10 machines, so nine teams could participate. Every team had three members, including celebrities such as the ALP President and the current, and next, JICSLP Program Chairs. In principle, people can preregister for this contest, but of course they never do. The exception was the winners of the previous two contests: the Melbourne team. So eager to win again, perhaps? At the reception before the conference, I encouraged more people to take part, and it seems that people find it difficult to say no. As in previous years, SICStus Prolog was used: thank you SICS for providing a free license for the contest. Also thanks to Thomas Fuchs for his great and punctual help, both before and during the competition. He had a tough time because, one hour before the contest, two machines broke down, and he only got them fixed a few minutes before the contest started. Since the Melbourne team had won this event twice before, it was hoped that a good challenger would turn up. In any case, it seemed not unthinkable that the Melbourne team could be defeated: after its victory in 1994 with a large margin, it had only won in 1995 by a few seconds over the Upsalla team. Personally, I thought Upsalla might win this time, as it had done consistently so well in previous contests. Unfortunately, the Upsalla team could not participate this year.

35. 2nd Annual Prolog Programming Contest 2nd Annual prolog programming Contest. Feel free to use them, and it wouldbe nice if you mentioned the annual prolog programming competition. http://www-lp.doc.ic.ac.uk/UserPages/staff/ft/alp/comment/contest2.html

2nd Annual Prolog Programming Contest Appeared in Volume 9/2, May 1996 Keywords : competition. Bart Demoen The second annual Prolog Programming Contest took place in Portland on Monday, 4th December 1995, at the Portland State University (PSU) during ILPS'95. Some lobbying during the ILPS'95 welcome reception resulted in 10 registered teams, consisting of 27 people, 20 of whom didn't compete last year. Well-known and respected people, taking the voluntarily risk of not winning this most prestigeous of all Prolog programming contests :). Every team was special in some respect, but perhaps the most notable was the team consisting of Saumya Debray, Phil Wadler and Peter Van Roy. Phil Wadler took part to "learn something about Prolog" (his words, more or less) and he was unique in submitting a solution using freeze/2 for the "powers" problem. The winning team of last year - the Australians from Melbourne: Peter Stuckey and Fergus Henderson - competed again, this time slightly handicapped by Thomas Conway :). The Swedish team from Uppsala (last year's runner-up) was also present, now with Jonas Barklund (ill with fever), Johan Bevemyr and Thomas Lindgren, who replaced Per Midler. Aside from these eminent groups, there was a team from Leuven (with two non-Belgians), one from Vancouver (with two non-Canadians), one from Madrid (consisting of three real Spaniards) and several mixed teams. One group with three members managed to represent four continents. Every problem was solved by at least one team and every team solved at least one problem. Every team submitted at least two solutions and most teams solved three. In fact, the average score was much higher than last year: 2.9 correct solutions per team, compared to 2.0 previously. This year the problems were just as difficult, but the contest only lasted two hours, not three as last year.

36. Intelligence-Soft - Prolog Programming Technology The development of generalpurpose business applications, prolog programming, softwarebased on artificial intelligence techniques, programming tools, Internet http://www.intsoft.spb.ru/prolog.html

document.write(drawMenu("prolog")); Prolog programming language was originally designed to be an Artificial Intelligence (AI) language, and it is very well suited for expert systems, planning systems and similar AI applications. Frame or rule-based systems, forward or backward chaining, pattern matching and constraint-resolution systems; all are natural and elegant expressions of Prolog's underlying semantics. The strength of Prolog extends far beyond the boundaries of AI. The high level of abstraction, the ease and simplicity with which complex data structures are represented lead to reduced development time and increased software product robustness. As a result the development cost of commercial software written in Prolog is usually lower and the quality of product is higher as compared with other programming languages. Visual Prolog, developed by Danish company Prolog Development Center with INTELLIGENCE-SOFT participation, is the most powerful and effective Prolog programming tool. It meets the professional's demands for speed and performance, producing compact, fast and highly optimized native machine code. Another great advantage of using Visual Prolog for commercial applications is portability between platforms. Today Visual Prolog supports DOS, MS Windows 16-bit and 32-bit, OS/2 and UNIX. It means that in many cases you need only to recompile your Windows application to get, for example, an OS/2 version looking (and working) exactly the same as original program.

37. Prolog Programming And Implementation Tricks prolog programming and Implementation Tricks Name Home Email . Enteryour comments here . Search through the discussion log. http://www.binnetcorp.com/hot_topics/prolog_tricks.html

Prolog Programming and Implementation Tricks Name: Home: Email: Enter your comments here Search through the discussion log. All information will be displayed if no match is found BinProlog FAQ Jinni FAQ Ongoing Open Code Prolog Implementation Projects , an innovative software development company specializing in Java and Prolog based Internet Programming, Intelligent Mobile Agent building tools, distributed AI and networked knowledge processing components. WWW: http://www.binnetcorp.com E-mail: binnetcorp@binnetcorp.com Tel:

38. Logtalk Home Page An objectoriented extension to the prolog programming language. It integrates logic programming with object-oriented and event-driven programming. Compatible with most Prolog compilers. Open source http://www.logtalk.org/

New Logtalk web site URL: http://www.logtalk.org . Please update your bookmarks! Logtalk Open source object-oriented extension to Prolog News Find the latest news about Logtalk (last updated on April 2 Features Summary of Logtalk features Compatibility List of Logtalk compatible Prolog compilers Examples Some examples of Logtalk programs Documentation User and reference manuals, tutorial, release notes and known problems list Download Download the latest release of Logtalk ( ) and the user and reference manuals CVS Download the latest Logtalk sources from the Logtalk CVS server Sign the Logtalk mailing list, get support, give feedback or leave your sugestions Links Links to related resources Home News Features Compatibility Documentation ... Paulo Moura Send any questions or suggestions regarding these pages to webmaster@logtalk.org Site updated on: April 2, 2003

39. Www.simtel.net: Visual Prolog 5 PE (Visual Prolog Programming Environment. Free) Visual prolog programming environment. Free. Visual Prolog is a completeprogramming environment based on the prolog programming language....... http://www2.simtel.net/pub/pd/60741.html

@import url(/simtel.css); Search Simtel Home Spotlights Doc's Picks News Letter Signup ... Handy Backup Translate into Spanish Portuguese French German Italian Japanese Korean Select a website mirror: USA Hungary Poland Program Information: Visual Prolog 5 PE (Version 5.2) var defaultAd = ''; var freqDays = 1; var freq = 1; var bsid = '18502'; var bsads = '7'; var bsloc = '1462494983'; var bswx = 720; var bshx = 300; var s = bswx + 'x' + bshx; var c = '916'; var cb = '2' Category: WinME / Win98 / Win95 / Programming Languages Publisher: Prolog Development Center A/S more programs by Prolog Development Center A/S Website: http://www.visual-prolog.com/vip/vipinfo/freeware_version.htm Screen Shot: View It! Program Name: Visual Prolog 5 PE, Version 5.2 File Name: vippe52.zip Downloads: Ware Type: Freeware System: Win98,WinME,WinNT 4.x,WinXP,Windows2000 File Size: 17.0 MBytes File Date: Description: Visual Prolog Programming environment. Free Visual Prolog is a complete programming environment based on the Prolog programming language. (Visual Prolog is the successor of TURBO Prolog and PDC Prolog). It contains everything needed for building large-scale commercial applications: a complete graphical development environment, a compiler, a linker and a debugger. Library support for Windows GUI, ODBC, HTTP, FTP, Sockets, and much more.

40. Www.simtel.net: Visual Prolog 6.0 (Visual Prolog: Programming Environment.) Visual prolog programming environment. Final Release (Build6006). vippe52.zip, 748, Visual prolog programming environment. Free....... http://www.simtel.net/pub/pd/60705.html

@import url(/simtel.css); Search Simtel Home Spotlights Doc's Picks News Letter Signup ... Handy Backup Translate into Spanish Portuguese French German Italian Japanese Korean Select a website mirror: USA Hungary Poland Program Information: Visual Prolog 6.0 (Version B6006) var defaultAd = ''; var freqDays = 1; var freq = 1; var bsid = '18502'; var bsads = '7'; var bsloc = '1462494983'; var bswx = 720; var bshx = 300; var s = bswx + 'x' + bshx; var c = '916'; var cb = '2' Category: WinME / Win98 / Win95 / Programming Languages Publisher: Prolog Development Center A/S more programs by Prolog Development Center A/S Website: http://www.visual-prolog.com/vip6/ Screen Shot: View It! Program Name: Visual Prolog 6.0, Version B6006 File Name: vip60.zip Downloads: Ware Type: Freeware System: Win98,WinME,WinNT 4.x,Windows2000 File Size: 7.8 MBytes File Date: Description: Visual Prolog: Programming environment. Final Release (Build 6006). Visual Prolog 6 is the latest generation of the Visual Prolog logical programming language counting PDC and Turbo Prolog as predecessors. The goal of Visual Prolog 6 is to support industrial strength programming of complex knowledge emphasized problems.

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

Page 2     21-40 of 114    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20