Geometry.Net - Basic_P: Prolog Programming


Home - Basic_P - Prolog Programming

e99.com Bookstore

Images

Newsgroups

61-80 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)

A Prolog Primer by Jean B. Rogers, 1986-06

Mastering Prolog by R Lucas, 1996-06-27

Symbolic Computing With Lisp and Prolog by Robert A. Mueller, Rex L. Page, 1988-11

Extensions of Logic Programming: Second International Workshop, ELP '91, Stockholm, Sweden, January 27-29, 1991. Proceedings (Lecture Notes in Artificial Intelligence 596)

Warren's Abstract Machine: A Tutorial Reconstruction (Logic Programming) by Hassan AÃ¯t-Kaci, 1991-08-12

Artificial Intelligence Techniques in Prolog by Yoav Shoham, Yoav Shohan, 1994-02

Prolog: The Standard: Reference Manual (Volume 0) by Pierre Deransart, AbdelAli Ed-Dbali, et all 1996-04-15

Logic Programming: First Russian Conference on Logic Programming, Irkutsk, Russia, September 14-18, 1990. Second Russian Conference on Logic Programming Lecture Notes in Artificial Intelligence 592

Prolog from the Beginning by Henry K. Konigsberger, Frank W. G. M. De Bruyn, 1990-04

Intelligent Image Processing in Prolog by Bruce G. Batchelor, 1991-06-17

A High Performance Architecture for Prolog (The Springer International Series in Engineering and Computer Science) by T.P. Dobry, 1990-01-31

Logic Programming and Automated Reasoning: 5th International Conference, LPAR '94, Kiev, Ukraine, July 16 - 22, 1994. Proceedings (Lecture Notes in Computer ... / Lecture Notes in Artificial Intelligence)

VLSI Prolog Processor, Design and Methodology: A Case Study in the High Level Language Processor Design by P. Civera, G. Masera, et all 1994-01-15

Prolog and Its Applications: A Japanese Perspective (Chapman & Hall Computing)

lists with details

Brandon Sanders' Prolog Programming Links
Brandon's prolog programming Link(s). USENET FAQs comp.lang.prologSEM223 Introduction starting Back to Brandon's Programming Links
http://www.cs.rochester.edu/~sanders/prog/prolog.html
CSC-302 98S : Outline Of Class 34: More Prolog Programming
Outline of Class 34 More prolog programming. Held Monday, April 27, 1998
http://www.math.grin.edu/~rebelsky/Courses/CS302/98S/Outlines/outline.34.html

Extractions: Instructions Search Current ... Assignments Held : Monday, April 27, 1998 Recall that Prolog uses the following syntax for lists: lists are surrounded by brackets; items in a list are separated by commas; the vertical bar acts like cons (more or less). the empty list [a,b,c] a list of three elements a list whose first element is a and whose remainder is the list X.
Prolog Programming
prolog programming. Yes i know you think i am a pervert but i like programmingin prolog. I am always interested to see what programs
http://www.soi.city.ac.uk/~nicos/programming/programming_interests.html

Extractions: Two of my latest programs utilise the PiLLoW library to implement a *clever* web fetcher and a web publisher for bib files ( on-line version ). An example application for the web fetcher was to automotic follow the fluctuation of the exchange rates for the greek drachma. This uses the x-window plotting program NoodlePlot (more info at livantes' homepage ). An example screen
HW5 - Prolog Programming Project
HW5 prolog programming Project. You will define a relation infix_postfixwhich is true when two lists representing expressions
http://www.cs.unm.edu/~bap/teach/F2001/CS451/hw5.html

Extractions: You will define a relation which is true when two lists representing expressions in the two little languages described below are ``equivalent'', meaning that they describe the same operations. The signature is . In other words, it can translate in both directions. The two little languages are called I and P, which stands for ``infix'' and ``postfix''. In each language you can express some simple arithmetic operations on one-character variables and numbers. To simplify processing, we will represent an expression in each language as a list of tokens, so we will feed Prolog the list [a,*,'(',b,+,1,')'] for the expression a*(b+1) in I. Note that quotes have been used to allow parenthesis tokens to be represented. The language I uses infix arithmetic notation. It has binary operators +, *, /, and -, and unary operators sin, cos, tan, and -. Note that - is both a binary and a unary operator. The language I has numbers, parenthesis, and 26 legal variables a, b, ..., z. The precedence rules are described by example, by showing an expression in I on the left, and then an equivalent one with extra parenthesis on the right. Basically, the trig unary operators bind most tightly, the binary operators * and / bind tighter than + and -, and binary operators associate to the right. The unary - binds looser than * and / but tighter than the binary operators + and -.
Practical Prolog Programming
Practical prolog programming. Details about practical prolog programmingand programming tools within the SICStus prolog programming
http://www.comp.lancs.ac.uk/computing/research/aai-aied/people/paulb/old243prolo

Extractions: Next: Search to the Up: No Title Previous: Prolog Programming Techniques Details about practical Prolog programming and programming tools within the SICStus Prolog programming environment can be found in the two ``interludes'' found in pages 33-41, and pages 77-80, and in appendix B, pages 99-100. Metalevel programming can be found illustrated in chapter 10, pages 81-88. paulb@comp.lancs.ac.uk
Prolog Programming Techniques
prolog programming Techniques. Basic prolog programming techniquesare found in chapter 6, pages 4250 and chapter 7, pages 52-60.
http://www.comp.lancs.ac.uk/computing/research/aai-aied/people/paulb/old243prolo

Extractions: Next: Practical Prolog Programming Up: No Title Previous: The Prolog Execution Basic Prolog programming techniques are found in chapter 6, pages 42-50 and chapter 7, pages 52-60. The use of negation is explained in chapter 7, pages 52-60 and the cut is explained in chapter 8, pages 61-70. paulb@comp.lancs.ac.uk
Prolog Programming: Searching (in Japanese)
Prolog? . Prolog v4).yes ? walk(v1, v5). C-c? Prolog interruption (h for help)? a
http://bach.scitec.kobe-u.ac.jp/prolog/intro/search.html

Extractions: Prolog ¤Î¥Ð¥¥¯¥È¥é¥¥¯ (¸åÌá¤ê) µ¡Ç½¤ò»È¤¦¤È¡¤ ¿ôÂ¿¤¯¤Î²ÄÇ½À¤Îæ¤«¤é²ò¤òµº÷¤¹¤ë¥×¥í¥°¥é¥à¤ò´Ê±¤Ëºî¤ì¤Þ¤¹¡¥ Í¸þ¥°¥é¥Õ¤Î·ÐÏ© (path) ¤òµº÷¤¹¤ë¥×¥í¥°¥é¥à¤òºî¤¤Æ¸«¤Þ¤·¤ç¤¦¡¥ ¤Þ¤º¡¤¼¡¤Î¤è¤¦¤ÊÍ¸þ¥°¥é¥Õ¤¬Í¿¤¨¤é¤ì¤Æ¤¤¤ë¤È¤·¤Þ¤¹¡¥ v1, v2, v3, v4, v5 ¤ÏÄºÅÀ (vertex)¡¤ a1, a2, a3, a4, a5 ¤Ï¸Ì (arc) ¤ÎÌ¾Á°¤Ç¤¹¡¥ ¤³¤Î¥°¥é¥Õ¤Ï¼¡¤Î¤è¤¦¤Ë Prolog ¤Î»ö¼Â¤Î½¸¤Þ¤ê¤ÇÉ½¸½¤Ç¤¤Þ¤¹¡¥ ¤³¤³¤Ç arc(A, U, V) ¤Ï¡¤ A ¤¬ U ¤«¤é V ¤Ø¤Î¸Ì¤Ç¤¢¤ë¤³¤È¤òÉ½¤·¤Þ¤¹¡¥ arc(a1, v1, v2). arc(a2, v2, v3). arc(a3, v3, v4). arc(a4, v4, v1). arc(a5, v3, v5). ¤Ç¤Ï¡¤Í¿¤¨¤é¤ì¤¿ÄºÅÀ U ¤«¤é V ¤Ø¤ÎÊâÆ» (walk) ¤¬Â¸ºß¤¹¤ë¤«¤É¤¦¤«¤ò Ä´¤Ù¤ë¥×¥í¥°¥é¥à¤ò½ñ¤¤¤Æ¸«¤Þ¤·¤ç¤¦¡¥ walk(U, U). walk(U, V) :- arc(_, U, U1), walk(U1, V). ¼Â¹Ô¤·¤Æ¸«¤ë¤È¡¤ v1 ¤«¤é v4 ¤Ê¤É¤Ë¤Ä¤¤¤Æ¤Ï¤Á¤ã¤ó¤È yes ¤ÈÉ½¼¨¤µ¤ì¤Þ¤¹¤¬ v1 ¤«¤é v5 ¤ÏÅú¤¬½Ð¤Þ¤»¤ó¡¥ ¤³¤ì¤Ï¡¤ v1 ¢ª v2 ¢ª v3 ¢ª v4 ¢ª v1 ¢ª ¡Ä ¤È¤Ê¤ê¡¤ ¥×¥í¥°¥é¥à¤¬Ìµ¸Â¥ë¡¼¥×¤·¤Æ¤¤¤ë¤¿¤á¤Ç¤¹¡¥ Ìµ¸Â¥ë¡¼¥×¤ò»ß¤á¤ë¤Ë¤Ï C-c (¥³¥ó¥È¥í¡¼¥ëC) ¤òÆþÎÏ¤·¤Æ¤«¤é a ¤òÆþ¤ì¤Þ¤¹¡¥ Ìµ¸Â¥ë¡¼¥×¤òÈò¤±¤ë¤¿¤á¤Ë¡¤1 ÅÙÄÌ¤¤¿ÄºÅÀ¤Ï¤â¤¦ÄÌ¤é¤Ê¤¤¤è¤¦¤Ë¤·¤Þ¤¹¡¥ ¤¹¤Ê¤ï¤ÁÆ» (path) ¤òµ¤¹¤è¤¦¤Ë½ñ´¹¤¨¤Þ¤¹¡¥ path_find(U, V, P) :- path(U, V, [U], P).
Prolog Programming: Recursive Programming (in Japanese)
The summary for this Japanese page contains characters that cannot be correctly displayed in this language/character set.
http://bach.scitec.kobe-u.ac.jp/prolog/intro/rec.html

Extractions: ºÆµ¢Åª¥×¥í¥°¥é¥ß¥ó¥° (recursive programming) ¤Ï¡¤ Lisp, ML ¤Ê¤É¤Î´Ø¿ô·¿¸À¸ì¤ä Prolog ¤Ê¤É¤ÎÏÀÍý·¿¸À¸ì¤Ç Èó¾ï¤ËÎÉ¤¯»È¤ï¤ì¤ë¥×¥í¥°¥é¥ß¥ó¥°ÊýË¡¤Ç¤¹¡¥ ºÆµ¢Åª¤Ê¹Í¤¨Êý¤Ë´·¤ì¤ë¤È¡¤ for ¤ä while ¤È¤¤¤¤¿·«¤êÊÖ¤·¹½Â¤¤è¤ê¤â ¤º¤¤È¥¨¥ì¥¬¥ó¥È¤Ë¥×¥í¥°¥é¥ß¥ó¥°¤Ç¤¤Þ¤¹¡¥ ºÆµ¢Åª¥×¥í¥°¥é¥ß¥ó¥°¤¬°ÒÎÏ¤òÈ¯´ø¤¹¤ë¤Î¤Ï¡¤ ¿ôÍ½èÍý¤è¤ê¤âµ¹æ½èÍý¤ä¥ê¥¹¥È½èÍý¤È¤¤¤¤¿Ê¬Ìî¤Ç¤¹¡¥ ¤·¤«¤·¤³¤³¤Ç¤Ï¡¤ºÆµ¢Åª¥×¥í¥°¥é¥ß¥ó¥°¤Ë´·¤ì¤ë¤³¤È¤òÌÜÅª¤Ë¡¤ ¿ôÍ½èÍý¤òæ¿´¤ËÀâÌÀ¤·¤Þ¤¹¡¥ SICStus Prolog¤ÇÍøÍÑ¤Ç¤¤ë»»½Ñ·×»»¤Ë¤Ä¤¤¤Æ¤Ï ¤¿¤È¤¨¤Ð¡¤³¬¾è n! ¤Ï¼¡¤Î¤è¤¦¤ËºÆµ¢Åª¤ËÄêµÁ¤Ç¤¤Þ¤¹¡¥ n! = 1 (n=0¤Î¤È¤) = n * (n-1)! (n>0¤Î¤È¤) ¤³¤ì¤ò Prolog ¤Ç¥×¥í¥°¥é¥à¤¹¤ë¤È°Ê²¼¤Î¤è¤¦¤Ë¤Ê¤ê¤Þ¤¹¡¥ fact(N, F) ¤Ï N! = F ¤Ç¤¢¤ë¤³¤È¤òÉ½¤·¤Þ¤¹¡¥ fact(0, 1). fact(N, F) :- N > 0, /* N > ¤ò¥Á¥§¥¥¯ */ N1 is N-1, /* N-1 ¤ò N1 ¤Ëµá¤á¤ë */ fact(N1, F1), /* N1! ¤ò F1 ¤Ëµá¤á¤ë */ F is N*F1. /* F ¤Ï N*F1 ¤È¤¹¤ë */ °ì¹ÔÌÜ¤Î»ö¼Â¤Ï¡¤0 ¤Î³¬¾è¤¬ 1 ¤Ç¤¢¤ë¤³¤È¤òÉ½¤·¤Þ¤¹¡¥ Æó¹ÔÌÜ¤Îµ¬Â§¤Ï¡¤ N ¤¬Àµ¤Î¤È¤¡¤ N ¤Î³¬¾è¤Ï N ¤È N-1 ¤Î³¬¾è¤ÎÀÑ¤Ç¤¢¤ë¤³¤È¤òÉ½¤·¤Þ¤¹¡¥ N-1 ¤Î³¬¾è¤òµá¤á¤ë¤Î¤Ë¡¤¼«Ê¬¼«¿È¤òºÆµ¢Åª¤Ë¸Æ¤Ó½Ð¤·¤Æ¤¤¤ëÅÀ¤Ë í°Õ¤·¤Æ¤¯¤À¤µ¤¤¡¥ ¥´¡¼¥ë ?- fact(100, F).
INTRODUCTION TO LOGIC PROGRAMMING (G5008)
This course introduces the basic syntax and semantics of the prolog programminglanguage. Bratko, I. (2001) prolog programming for Artificial Intelligence.
http://www.cogs.susx.ac.uk/csai/handbook/csaihandbooknode60.html

Extractions: Left: INTRODUCTION TO LOGIC (G5059) Up: Computer Science and Artificial Right: INTRODUCTION TO OPERATING SYSTEMS This course introduces the basic syntax and semantics of the Prolog programming language. It covers basic techniques of logic programming, the built in features of the language, and describes its application to some typical AI topics.
The Mercury Project: [mercury-users] 6th Prolog Programming Competition
The Mercury Project mercuryusers 6th prolog programming Competition. Announcementof the. 6th prolog programming Competition. at the occasion of the.
http://www.cs.mu.oz.au/research/mercury/mailing-lists/mercury-users/mercury-user
The Mercury Project: [mercury-users] The 7th Prolog Programming Contest
The Mercury Project mercuryusers The 7th prolog programming Contest.
http://www.cs.mu.oz.au/research/mercury/mailing-lists/mercury-users/mercury-user
JosseyBass :: Techniques Of Prolog Programming With Implementation Of Logical Ne
JosseyBass, Techniques of prolog programming with Implementationof Logical Negation and Quantified Goals by T. Van Le.
http://www.josseybass.com/cda/product/0,,047157175X,00.html
Prolog Programming
Introduction to Prolog, part 2. In this note we explain how prolog answersqueries, with a view to getting a procedural understanding of prolog.
http://www.dcs.warwick.ac.uk/~pwg/cs205/prolog2.html

Extractions: In this note we explain how prolog answers queries, with a view to getting a procedural understanding of prolog. A prolog program expresses relationships in first-order predicate logic, and the prolog system can apply a form of resolution to infer other things implied by the program. You should be able to see that given the "ancestor" code (reproduced below) that it is at least possible in principle to use it to answer queries about who is an ancestor of whom. In order to program effectively in prolog, it is necessary to have some understanding of how the prolog system goes about using the code to answer queries automatically parent(bob, ted). parent(ted, kev). parent(ted, lulu). parent(lulu, meg). ancestor(X,Y) :- parent(X,Y). ancestor(X,Y) :- parent(X,Z),ancestor(Z,Y). Each of the above lines of code is a clause . A clause has a head consisting of a predicate with arguments (that may be constants or variables), and a body consisting of a (possibly empty) sequence of predicates with arguments. Clauses end with a full stop. When the body is non-empty, it is separated from the head by :-, which as mentioned in note 1 means "if" or "provided that". So what a clause is saying is that the head is true provided that all predicates in the body are true. Given a query or goal, such as parent(lulu,X).
Prolog Programming
Introduction to Prolog, part 3. The structured data objects that prologdeals with (such as boolean formulae) have a treelike structure.
http://www.dcs.warwick.ac.uk/~pwg/cs205/prolog3.html

Extractions: In this note we look at structured data objects in general, and lists in particular. We first describe the general structure of data objects, and then explain how lists fit into the paradigm, despite having a special syntax which makes them look different. This program contains some commonly-defined predicates involving lists. So far all data items (such as bob, kev and so on) have been "atoms". Prolog programs can also manipulate numerical quantities, but its main strength is symbol manipulation, and that is what we are going to look at here. For example we will see how to define and manipulate propositional-logic boolean formulae made up of symbols representing "and", "or", "not" and boolean variables. The structured data objects that prolog deals with (such as boolean formulae) have a tree-like structure. Within a (parsed) boolean formula, every "and" and "or" would connect two subformulae, and every "not" would apply to one subformula. Prolog manipulates terms , built up from atoms (such as variable symbols) and functors which are the connectives that glue together subterms. A functor is a symbol that takes some fixed number of terms, each of which is a subtree attached below a node labelled by that functor's label. A term is represented syntactically by its top-level functor, followed by the subterms, in a sequence separated by commas and enclosed in parentheses.
Prolog Programming For Artificial Intelligence; Author: Bratko, Ivan; Paperback
prolog programming For Artificial Intelligence Author Bratko, Ivan Edition 3;International Computer Science Series; Paperback 560 pages Published August
http://www.opengroup.com/cbbooks/020/0201403757.shtml
Prolog Tutorial -- Introduction
The sample programs have been especially chosen to help promote theuse of prolog programming in an artificial intelligence course.
http://www.csupomona.edu/~jrfisher/www/prolog_tutorial/intro.html

Extractions: Please notify the author before including a link to any of the pages in this tutorial. Permission to copy is denied. Permission to link is freely granted. Prolog is the major example of a fourth generation programming language supporting the declarative programming paradigm. The Japanese Fifth-Generation Computer Project, announced in 1981, adopted Prolog as a development language, and thereby focused considerable attention on the language and its capabilities. The programs in this tutorial are written in "standard" (University of) Edinburgh Prolog, as specified in the classic Prolog textbook by authors Clocksin and Mellish (1981,1992). The other major kind of Prolog is the PrologII family of Prologs which are the descendants of Marseille Prolog. The reference to Giannesini, et.al. (1986) uses a version of PrologII. There are differences between these two varieties of Prolog; part of the difference is syntax, and part is semantics. However, students who learn either kind of Prolog can easily adapt to the other kind. This tutorial is intended to be used to help learn the essential, basic concepts of Prolog. The sample programs have been especially chosen to help promote the use of Prolog programming in an artificial intelligence course. Lisp and Prolog are the most frequently used symbolic programming languages for artificial intelligence. They are widely regarded as excellent languages for "exploratory" and "prototype programming".
Free Online Prolog Tutorials (thefreecountry.com)
Free Online Prolog Tutorials. prolog programming Tutorials and References. FreeOnline prolog programming Tutorials and Documentation.
http://www.thefreecountry.com/documentation/onlineprolog.shtml

Extractions: If you find this site useful, please link to us This page lists free online tutorials and references on the Prolog programming language and on logic programming. Many of the tutorials are designed to teach you how to program in Prolog from ground up. You may also be interested in getting a free Prolog compiler or interpreter from the Free Prolog Compilers and Interpreters page. If you are looking for a beginner's book on Prolog, The Art of Prolog, Second Edition: Advanced Programming Techniques (Logic Programming) appears to be frequently recommended. For a more advanced book, The Craft of Prolog (Logic Programming) is probably indispensable. Free Online Prolog Programming Tutorials and Documentation This is a Prolog tutorial from Bucknell University. It teaches Prolog from ground up, using the free SWI Prolog compiler (see the
Prolog - Tutorials --> BRILLIANeT - Programming
prolog programming Tutorials, Recommended books ++ Bratko,I prolog programmingfor Artificial Intelligence (third edition), Addison-Wesley, 2001;
http://www.brillianet.com/programming/prolog/tutorials/
Logic Programming Associates
This software house supplies WINprolog, Macprolog32 and prolog++.
http://www.lpa.co.uk/
Build A Program Immediately From Data Processing Examples
Build a program immediately from data processing examples AI language, simpler than prolog, based on generalization and matching of unconstrained text processing samples.
http://sampletalk.8m.com/

Extractions: Introduction Descri p ... and technology Program Examples: Natura l l a ... Perspectives for the Future This is a description of AI language Sampletalk and of the corresponding programming technology. What is this about: Why we create hundreds of thousands (may be millions?) of objects, which cannot interact well, and most of which fly out to the Forget-River almost immediately after their birth? Sometimes they exist a few years, but objects are inevitably flying out, unlike music or math, which live much longer. Why programmers remind people, who include springs into dummies, and then try to persuade themselves (and others) that these dummies are smart? How many billions of dead objects and such dummies will be in the next decade if we will not find another way to interconnect numerous pieces of our knowledge? Do we think using objects ? If yes, do we think of special lists of their

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

61-80 of 114 Back | 1 | 2 | 3 | 4 | 5 | 6 | Next 20