Geometry.Net - Basic_P: Prolog Programming


Home - Basic_P - Prolog Programming

e99.com Bookstore

Images

Newsgroups

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

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)

Computing With Logic: Logic Programming With Prolog by David Maier, David S. Warren, 1988-01

Agent-Oriented Programming: From Prolog to Guarded Definite Clauses (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence) by Matthew M. Huntbach, Graem A. Ringwood, 1999-12-10

Prolog Programming for Students: With Expert Systems and Artificial Intelligence Topics by David Callear, 2001-01-16

Natural Language Processing for Prolog Programmers by Michael A. Covington, 1993-08-13

Logic, Programming and Prolog by Ulf Nilsson, Jan Mauszynski, 1995-08

PROLOG Programming by Nigel Ford, 1989-08-16

Artificial Intelligence Programming with Turbo PROLOG by Keith Weiskamp, Terry Hengl, 1988-02-17

Concurrent Prolog - 2 vol. set: Collected Papers (Logic Programming)

Introduction to Programming in Prolog (Prentice Hall International series in computer science) by Danny Crookes, 1988-08

Why Prolog? Justifying Logic Programming for Practical Application by Gregory L. Lazarev, 1989-01

Prolog & Expert Systems Programming by Kenneth A. Bowen, 1991-02-01

Advanced Turbo PROLOG: Version 1. 1 (Borland-Osborne/McGraw-Hill programming series) by Herbert Schildt, 1987-07-01

Logic Programming: Prolog and Stream Parallel Languages (Prentice Hall Advances in Computer Science Series) by J. D. Newmarch, 1990-01

Advanced Prolog: Techniques and Examples (International Series in Logic Programming) by Peter Ross, 1989-08

lists with details

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
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

Extractions: 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.
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/

Extractions: Spring 2002 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
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/

Extractions: Spring 2003 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. Knowledge of Unix (equivalent to Ctl130) Knowledge of Emacs (equivalent to Chapters 1-5 of
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

Extractions: DIY ): Do It Yourself [ lab3.html prolog.summary.html prolog.predicates.html expressions prolog.glossary.html ... prolog.FAQ prolog.semantics.html prolog.syntax.html http://www.csci.csusb.edu/dick/cs320/prolog/ prolog.www.sites.html prolog.mbox prolog.news prolog.FAQ ... prolog.mbox At CSci.CSUSB we have two systems available.
OOPWeb.com - Prolog Directory - Tutorials, References, Guides...
prolog programming tutorial and online book.
http://www.oopweb.com/Prolog/Files/Prolog.html

Extractions: 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
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

Extractions: 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 ....
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

Extractions: 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.
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

Extractions: - 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.
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
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/

Extractions: 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 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. 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.
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

Extractions: Go to the previous next section. 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: The code herein was derived in part from shared code written by by R.A. O'Keefe. 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.
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

Extractions: Go to the first previous next last section, table of contents 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. 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
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

Extractions: 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.
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

Extractions: 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.
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

Extractions: 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.
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

Extractions: 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:
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/
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

Extractions: 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.
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

Extractions: 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.

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

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