Fundamental Prolog Part 2 - Revision history

Taras.evt: Fix typo in code

2014-03-23T17:52:38Z

Fix typo in code

← Older revision		Revision as of 19:52, 23 March 2014
Line 90:		Line 90:
	Now, after you re-consult the above code into '''PIE''', and give the following goal:		Now, after you re-consult the above code into '''PIE''', and give the following goal:

	<vip>grandFather(person'("Pam", "female"), W)</vip>		<vip>grandFather(person("Pam", "female"), W)</vip>

	the results would be as follows:		the results would be as follows:

Gukalov: /* Recursion Using Functors */

2013-09-18T16:26:19Z

Recursion Using Functors

← Older revision		Revision as of 18:26, 18 September 2013
Line 194:		Line 194:
	...this is what we will get:		...this is what we will get:

	[[Image:Fundamental_Prolog_2_fig4.~~jpg~~]]		[[Image:Fundamental_Prolog_2_fig4.png]]

	The '''PIE''' engine has recursively examined the parent facts to reveal the two possible solutions to the answer. By the way, in the above query, you would also notice that we have bound a variable P to the person '''compound domain''' when specifying the goal to '''PIE'''. This was done to make the code more readable but it also demonstrates the fact that we can bind a piece of data specified as a '''compound domain''' into any Prolog variable.		The '''PIE''' engine has recursively examined the parent facts to reveal the two possible solutions to the answer. By the way, in the above query, you would also notice that we have bound a variable P to the person '''compound domain''' when specifying the goal to '''PIE'''. This was done to make the code more readable but it also demonstrates the fact that we can bind a piece of data specified as a '''compound domain''' into any Prolog variable.

Gukalov: /* Refining Further */

2013-09-18T16:25:50Z

Refining Further

← Older revision		Revision as of 18:25, 18 September 2013
Line 86:		Line 86:
	Let us now use this code in a complete example, where we will give a suitable set of person'''' facts:		Let us now use this code in a complete example, where we will give a suitable set of person'''' facts:

	[[Image:Fundamental_Prolog_2_fig3b.~~jpg~~]]		[[Image:Fundamental_Prolog_2_fig3b.png]]

	Now, after you re-consult the above code into '''PIE''', and give the following goal:		Now, after you re-consult the above code into '''PIE''', and give the following goal:
Line 94:		Line 94:
	the results would be as follows:		the results would be as follows:

	[[Image:Fundamental_Prolog_2_fig3c.~~jpg~~]]		[[Image:Fundamental_Prolog_2_fig3c.png]]

	==Functors and Predicates==		==Functors and Predicates==

Gukalov: /* Functors */

2013-09-18T16:22:50Z

Functors

← Older revision		Revision as of 18:22, 18 September 2013
Line 31:		Line 31:
	Please note that in the '''PIE''' (Prolog Inference Engine) that we are using, we can directly use a '''compound domain''' without any prior intimation to the Prolog engine (for example. we need NOT define a predicate or a fact called ''person'' for our code to work).		Please note that in the '''PIE''' (Prolog Inference Engine) that we are using, we can directly use a '''compound domain''' without any prior intimation to the Prolog engine (for example. we need NOT define a predicate or a fact called ''person'' for our code to work).

	[[Image:Fundamental_Prolog_2_fig1.~~jpg~~]]		[[Image:Fundamental_Prolog_2_fig1.png]]

	If you study the two facts for the father relationship, you would notice that the persons described are richer than what was done before (The earlier code is commented out in-between the tokens '''/''' and '''/''' .). This time, each person is described with both the person's name '''and''' his/her gender, using the person '''functor''', whereas in the earlier tutorial (Fundamental Prolog (Part1)) we were only using the person's name.		If you study the two facts for the father relationship, you would notice that the persons described are richer than what was done before (The earlier code is commented out in-between the tokens '''/''' and '''/''' .). This time, each person is described with both the person's name '''and''' his/her gender, using the person '''functor''', whereas in the earlier tutorial (Fundamental Prolog (Part1)) we were only using the person's name.
Line 41:		Line 41:
	For example:		For example:

	[[Image:Fundamental_Prolog_2_fig2.~~jpg~~]]		[[Image:Fundamental_Prolog_2_fig2.png]]

	When the caret is placed at the end of the line, press the '''Enter''' key on your keyboard. '''PIE''' will now consider the text from the beginning of the line to the caret as a goal to execute. You should see the following result:		When the caret is placed at the end of the line, press the '''Enter''' key on your keyboard. '''PIE''' will now consider the text from the beginning of the line to the caret as a goal to execute. You should see the following result:

	[[Image:Fundamental_Prolog_2_fig3.~~jpg~~]]		[[Image:Fundamental_Prolog_2_fig3.png]]

	Now, you will notice that the results that are yielded are richer than what you got previously (See Tutorial 04: Fundamental Prolog (Part 1)).		Now, you will notice that the results that are yielded are richer than what you got previously (See Tutorial 04: Fundamental Prolog (Part 1)).

Thomas Linder Puls: Fundamental Prolog Tutorial

2011-08-12T08:42:57Z

Fundamental Prolog Tutorial

← Older revision		Revision as of 10:42, 12 August 2011
Line 220:		Line 220:
	==References==		==References==

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

DmitriRybakov: /* Recursion Using Functors */

2007-12-20T13:11:37Z

Recursion Using Functors

← Older revision		Revision as of 15:11, 20 December 2007
Line 190:		Line 190:
	If we now ask '''PIE''' to solve the following goal,		If we now ask '''PIE''' to solve the following goal,

	<vip>P=person("pam", "female"), ~~a ncestor~~(P, Who)</vip>		<vip>P=person("pam", "female"), ancestor(P, Who)</vip>

	...this is what we will get:		...this is what we will get:

Thomas Linder Puls: Navigation bar

2007-08-28T11:09:51Z

Navigation bar

← Older revision		Revision as of 13:09, 28 August 2007
Line 1:		Line 1:
			{{FundamentalPrologNavbar}}

	In this tutorial you will learn about some more fundamental ideas of Prolog programming; continuing from where we left off in the Part 1 of this tutorial (Fundamental Prolog). In this tutorial, we are going to concentrate on how data is ''modeled'' in Prolog, before we can perform actions on them. Hence, there are not much examples concerning code execution here. We are assuming that you are already familiar with the issues concerning '''execution strategy''' and how '''side effects''' convert the logic of a Prolog program into the desired '''results'''.		In this tutorial you will learn about some more fundamental ideas of Prolog programming; continuing from where we left off in the Part 1 of this tutorial (Fundamental Prolog). In this tutorial, we are going to concentrate on how data is ''modeled'' in Prolog, before we can perform actions on them. Hence, there are not much examples concerning code execution here. We are assuming that you are already familiar with the issues concerning '''execution strategy''' and how '''side effects''' convert the logic of a Prolog program into the desired '''results'''.

Thomas Linder Puls: Change of Image Names

2007-08-23T22:26:04Z

Change of Image Names

← Older revision		Revision as of 00:26, 24 August 2007
Line 192:		Line 192:
	...this is what we will get:		...this is what we will get:

	[[Image:~~fig4~~.jpg]]		[[Image:Fundamental_Prolog_2_fig4.jpg]]

	The '''PIE''' engine has recursively examined the parent facts to reveal the two possible solutions to the answer. By the way, in the above query, you would also notice that we have bound a variable P to the person '''compound domain''' when specifying the goal to '''PIE'''. This was done to make the code more readable but it also demonstrates the fact that we can bind a piece of data specified as a '''compound domain''' into any Prolog variable.		The '''PIE''' engine has recursively examined the parent facts to reveal the two possible solutions to the answer. By the way, in the above query, you would also notice that we have bound a variable P to the person '''compound domain''' when specifying the goal to '''PIE'''. This was done to make the code more readable but it also demonstrates the fact that we can bind a piece of data specified as a '''compound domain''' into any Prolog variable.

Thomas Linder Puls: Change of Image Names

2007-08-23T22:24:35Z

Change of Image Names

← Older revision		Revision as of 00:24, 24 August 2007
Line 84:		Line 84:
	Let us now use this code in a complete example, where we will give a suitable set of person'''' facts:		Let us now use this code in a complete example, where we will give a suitable set of person'''' facts:

	[[Image:~~fig3b~~.jpg]]		[[Image:Fundamental_Prolog_2_fig3b.jpg]]

	Now, after you re-consult the above code into '''PIE''', and give the following goal:		Now, after you re-consult the above code into '''PIE''', and give the following goal:
Line 92:		Line 92:
	the results would be as follows:		the results would be as follows:

	[[Image:~~fig3c~~.jpg]]		[[Image:Fundamental_Prolog_2_fig3c.jpg]]

	==Functors and Predicates==		==Functors and Predicates==

Thomas Linder Puls: Change of Image Names

2007-08-23T22:21:34Z

Change of Image Names

← Older revision		Revision as of 00:21, 24 August 2007
Line 29:		Line 29:
	Please note that in the '''PIE''' (Prolog Inference Engine) that we are using, we can directly use a '''compound domain''' without any prior intimation to the Prolog engine (for example. we need NOT define a predicate or a fact called ''person'' for our code to work).		Please note that in the '''PIE''' (Prolog Inference Engine) that we are using, we can directly use a '''compound domain''' without any prior intimation to the Prolog engine (for example. we need NOT define a predicate or a fact called ''person'' for our code to work).

	[[Image:~~fig1~~.jpg]]		[[Image:Fundamental_Prolog_2_fig1.jpg]]

	If you study the two facts for the father relationship, you would notice that the persons described are richer than what was done before (The earlier code is commented out in-between the tokens '''/''' and '''/''' .). This time, each person is described with both the person's name '''and''' his/her gender, using the person '''functor''', whereas in the earlier tutorial (Fundamental Prolog (Part1)) we were only using the person's name.		If you study the two facts for the father relationship, you would notice that the persons described are richer than what was done before (The earlier code is commented out in-between the tokens '''/''' and '''/''' .). This time, each person is described with both the person's name '''and''' his/her gender, using the person '''functor''', whereas in the earlier tutorial (Fundamental Prolog (Part1)) we were only using the person's name.
Line 39:		Line 39:
	For example:		For example:

	[[Image:~~fig2~~.jpg]]		[[Image:Fundamental_Prolog_2_fig2.jpg]]

	When the caret is placed at the end of the line, press the '''Enter''' key on your keyboard. '''PIE''' will now consider the text from the beginning of the line to the caret as a goal to execute. You should see the following result:		When the caret is placed at the end of the line, press the '''Enter''' key on your keyboard. '''PIE''' will now consider the text from the beginning of the line to the caret as a goal to execute. You should see the following result:

	[[Image:~~fig3~~.jpg]]		[[Image:Fundamental_Prolog_2_fig3.jpg]]

	Now, you will notice that the results that are yielded are richer than what you got previously (See Tutorial 04: Fundamental Prolog (Part 1)).		Now, you will notice that the results that are yielded are richer than what you got previously (See Tutorial 04: Fundamental Prolog (Part 1)).