Fundamental Prolog Part 1 - Revision history

Gukalov: /* PIE: Prolog Inference Engine */

2013-09-18T15:46:56Z

PIE: Prolog Inference Engine

← Older revision		Revision as of 17:46, 18 September 2013
Line 120:		Line 120:
	In the '''''Dialog''''' window you should receive a message like this:		In the '''''Dialog''''' window you should receive a message like this:

	<pre>Reconsulted from: ....\pie\Exe\~~FILE4~~.PRO</pre>		<pre>Reconsulted from: ....\pie\Exe\FILE0.PRO</pre>

	Reconsult loads whatever is in the editor, '''''without''''' saving the contents to the file, if you want to save the contents use '''File -> Save'''.		Reconsult loads whatever is in the editor, '''''without''''' saving the contents to the file, if you want to save the contents use '''File -> Save'''.

Thomas Linder Puls: /* PIE: Prolog Inference Engine */ link

2013-02-12T09:45:21Z

PIE: Prolog Inference Engine: link

← Older revision		Revision as of 11:45, 12 February 2013
Line 106:		Line 106:

	*Select "Install Examples" in the Windows start menu ('''Start -> Visual Prolog -> Install Examples''').		*Select "Install Examples" in the Windows start menu ('''Start -> Visual Prolog -> Install Examples''').
	*Open the PIE project in the IDE and '''run''' the program, as it is described in the [[Environment Overview]].		*Open the PIE project in the IDE and '''run''' the program, as it is described in the [[Ide/Environment Overview\|Environment Overview]].

	When the program starts it will look like this:		When the program starts it will look like this:

Thomas Linder Puls: Fundamental Prolog Tutorial

2011-08-12T08:41:57Z

Fundamental Prolog Tutorial

← Older revision		Revision as of 10:41, 12 August 2011
Line 599:		Line 599:
	==References==		==References==

	[[Category:~~Tutorials~~]]		[[Category:Fundamental Prolog Tutorial]]

Elizabeth Safro: /* PIE: Prolog Inference Engine */

2011-02-24T11:56:52Z

PIE: Prolog Inference Engine

← Older revision		Revision as of 13:56, 24 February 2011
Line 106:		Line 106:

	*Select "Install Examples" in the Windows start menu ('''Start -> Visual Prolog -> Install Examples''').		*Select "Install Examples" in the Windows start menu ('''Start -> Visual Prolog -> Install Examples''').
	*Open the PIE project in the ~~VDE~~ and '''run''' the program, as it is described in ~~<a href="../tut01/default.htm">Tutorial 01:~~ Environment Overview~~</a>~~.		*Open the PIE project in the IDE and '''run''' the program, as it is described in the [[Environment Overview]].

	When the program starts it will look like this:		When the program starts it will look like this:

Elizabeth Safro: /* PIE: Prolog Inference Engine */

2008-11-13T16:58:23Z

PIE: Prolog Inference Engine

← Older revision		Revision as of 18:58, 13 November 2008
Line 102:		Line 102:

	Now we will try the little example above in PIE, the Prolog Inference Engine that comes with Visual Prolog.		Now we will try the little example above in PIE, the Prolog Inference Engine that comes with Visual Prolog.
	~~You can also [http://www.visual-prolog.com/vip/example/pie/pie.htm download] it from the web.~~

	Before we start you should install and build the PIE example.		Before we start you should install and build the PIE example.

Elizabeth Safro at 16:56, 13 November 2008

2008-11-13T16:56:55Z

← Older revision		Revision as of 18:56, 13 November 2008
Line 7:		Line 7:
	But in this tutorial we will focus on the ''core'' of the code, i.e. the Prolog code when disregarding classes, types and modes.		But in this tutorial we will focus on the ''core'' of the code, i.e. the Prolog code when disregarding classes, types and modes.

	For this purpose we will use the PIE example that is included in the Visual Prolog distribution		For this purpose we will use the PIE example that is included in the Visual Prolog distribution.

	PIE is a "classical" Prolog interpreter, by using this you can learn and experiment with Prolog without at all being concerned with classes, types, etc.		PIE is a "classical" Prolog interpreter, by using this you can learn and experiment with Prolog without at all being concerned with classes, types, etc.

Elizabeth Safro: A download link has been removed.

2008-11-13T16:56:19Z

A download link has been removed.

← Older revision		Revision as of 18:56, 13 November 2008
Line 7:		Line 7:
	But in this tutorial we will focus on the ''core'' of the code, i.e. the Prolog code when disregarding classes, types and modes.		But in this tutorial we will focus on the ''core'' of the code, i.e. the Prolog code when disregarding classes, types and modes.

	For this purpose we will use the PIE example that is included in the Visual Prolog distribution ~~PIE might be also [http://www.visual-prolog.com/vip/example/pie/pie.htm downloaded] from the WEB as an executable.~~		For this purpose we will use the PIE example that is included in the Visual Prolog distribution
	PIE is a "classical" Prolog interpreter, by using this you can learn and experiment with Prolog without at all being concerned with classes, types, etc.		PIE is a "classical" Prolog interpreter, by using this you can learn and experiment with Prolog without at all being concerned with classes, types, etc.

Thomas Linder Puls: formatting

2008-01-25T07:44:58Z

<vp></vp> formatting

DmitriRybakov: /* Program Control */

2007-12-20T13:10:43Z

Program Control

← Older revision		Revision as of 15:10, 20 December 2007
Line 253:		Line 253:
	Given the strict evaluation we can read this rule like this:		Given the strict evaluation we can read this rule like this:

	To solve grandFather(Person, GrandFather) '''first''' solve father(Person, Father) '''and then '''~~solvefather~~(Father, GrandFather).		To solve grandFather(Person, GrandFather) '''first''' solve father(Person, Father) '''and then '''solve father(Father, GrandFather).

	Or even like this:		Or even like this:

Elizabeth Safro at 13:46, 13 November 2007

2007-11-13T13:46:50Z

← Older revision		Revision as of 15:46, 13 November 2007
Line 7:		Line 7:
	But in this tutorial we will focus on the ''core'' of the code, i.e. the Prolog code when disregarding classes, types and modes.		But in this tutorial we will focus on the ''core'' of the code, i.e. the Prolog code when disregarding classes, types and modes.

	For this purpose we will use the PIE example that is included in the Visual Prolog distribution.		For this purpose we will use the PIE example that is included in the Visual Prolog distribution PIE might be also [http://www.visual-prolog.com/vip/example/pie/pie.htm downloaded] from the WEB as an executable.
	PIE is a "classical" Prolog interpreter, by using this you can learn and experiment with Prolog without at all being concerned with classes, types, etc.		PIE is a "classical" Prolog interpreter, by using this you can learn and experiment with Prolog without at all being concerned with classes, types, etc.

← Older revision		Revision as of 09:44, 25 January 2008
Line 40:		Line 40:
	<vip>X is the grandfather of Z, if X is the father of Y and Y is the father of Z</vip>		<vip>X is the grandfather of Z, if X is the father of Y and Y is the father of Z</vip>

	where X, Y and Z are persons.		where <vp>X</vp>, <vp>Y</vp> and <vp>Z</vp> are persons.
	In Horn Clause Logic I can formalize this rule like this:		In Horn Clause Logic I can formalize this rule like this:

Line 46:		Line 46:
	father(Person, Father), father(Father, GrandFather).</vip>		father(Person, Father), father(Father, GrandFather).</vip>

	I have chosen to use '''''variable''''' names that help understanding better than X, Y and Z.		I have chosen to use '''''variable''''' names that help understanding better than <vp>X</vp>, <vp>Y</vp> and <vp>Z</vp>.
	I have also introduced a predicate for the grandfather relation.		I have also introduced a predicate for the grandfather relation.
	Again I have chosen that the grandfather should be the second argument.		Again I have chosen that the grandfather should be the second argument.
Line 52:		Line 52:
	When reading rules you should interpret :- as '''''if''''' and the comma that separates the relations as '''''and'''''.		When reading rules you should interpret :- as '''''if''''' and the comma that separates the relations as '''''and'''''.

	Statements like "John is the father of Bill" are called '''''facts''''', while statements like "X is the grandfather of Z, if X is the father of Y and Y is the father of Z" are called '''''rules'''''.		Statements like "John is the father of Bill" are called '''''facts''''', while statements like "<vp>X</vp> is the grandfather of <vp>Z</vp>, if <vp>X</vp> is the father of <vp>Y</vp> and <vp>Y</vp> is the father of <vp>Z</vp>" are called '''''rules'''''.

	With facts and rules we are ready to formulate theories.		With facts and rules we are ready to formulate theories.
Line 83:		Line 83:

	Some goals like the first and last are answered with a simple ''yes'' or ''no''.		Some goals like the first and last are answered with a simple ''yes'' or ''no''.
	For other goals like the second we seek a '''''solution''''', like X = "Bill".		For other goals like the second we seek a '''''solution''''', like <vp>X = "Bill"</vp>.

	Some goals may even have many solutions.		Some goals may even have many solutions.