Lab: RDF programming with RDFlib - Revision history

Rbo027: Added lab 1 and 2 presentation

2024-01-28T13:20:08Z

Added lab 1 and 2 presentation

← Older revision		Revision as of 13:20, 28 January 2024
Line 9:		Line 9:
	* [https://rdflib.readthedocs.io/en/stable/intro_to_graphs.html Navigating Graphs]		* [https://rdflib.readthedocs.io/en/stable/intro_to_graphs.html Navigating Graphs]
	* [https://rdflib.readthedocs.io/en/stable/intro_to_parsing.html Serialising and parsing]		* [https://rdflib.readthedocs.io/en/stable/intro_to_parsing.html Serialising and parsing]

			Lab Presentations:
			* [https://docs.google.com/presentation/d/1blXlTTTsL8jqeV5sRLhQuZ-nssNZqH_bjSgjj-kougE/edit?usp=sharing Lab 1 - RDF Presentation]
			* [https://docs.google.com/presentation/d/17yuNqn66fhEIHPE65PyFC0H359q1k6CquE6ojDV0NB4/edit?usp=sharing Lab 2 - More RDF Presentation]

	RDFlib classes/interfaces:		RDFlib classes/interfaces:

Sinoa: /* Triples you can extend for the tasks (turtle format) */

2024-01-14T22:45:34Z

Triples you can extend for the tasks (turtle format)

← Older revision		Revision as of 22:45, 14 January 2024
Line 56:		Line 56:
	''Note:'' If you want a neat solution, it may be best to combine two graph traversals: first traverse the model breadth-first to create a new tree-shaped model, and then traverse the tree-shaped model depth-first to print it out with indentation. (The point of the first breadth-first step is to find the shortest path to each node.)		''Note:'' If you want a neat solution, it may be best to combine two graph traversals: first traverse the model breadth-first to create a new tree-shaped model, and then traverse the tree-shaped model depth-first to print it out with indentation. (The point of the first breadth-first step is to find the shortest path to each node.)

			<!--
	==Triples you can extend for the tasks (turtle format)==		==Triples you can extend for the tasks (turtle format)==
	<syntaxhighlight>		<syntaxhighlight>
Line 86:		Line 87:

	</syntaxhighlight>		</syntaxhighlight>
			-->

Rbo027 at 20:47, 24 January 2023

2023-01-24T20:47:39Z

← Older revision		Revision as of 20:47, 24 January 2023
Line 55:		Line 55:

	''Note:'' If you want a neat solution, it may be best to combine two graph traversals: first traverse the model breadth-first to create a new tree-shaped model, and then traverse the tree-shaped model depth-first to print it out with indentation. (The point of the first breadth-first step is to find the shortest path to each node.)		''Note:'' If you want a neat solution, it may be best to combine two graph traversals: first traverse the model breadth-first to create a new tree-shaped model, and then traverse the tree-shaped model depth-first to print it out with indentation. (The point of the first breadth-first step is to find the shortest path to each node.)

			==Triples you can extend for the tasks (turtle format)==
			<syntaxhighlight>
			@prefix ex: <http://example.org/> .

			ex:Mueller_Investigation ex:involved ex:George_Papadopoulos,
			ex:Michael_Cohen,
			ex:Michael_Flynn,
			ex:Paul_Manafort,
			ex:Rick_Gates,
			ex:Roger_Stone ;
			ex:leadBy ex:Robert_Muller .

			ex:Paul_Manafort ex:businessManager ex:Rick_Gates ;
			ex:campaignChairman ex:Donald_Trump ;
			ex:chargedWith ex:ForeignLobbying,
			ex:MoneyLaundering,
			ex:TaxEvasion ;
			ex:convictedFor ex:BankFraud,
			ex:TaxFraud ;
			ex:negoiated ex:PleaBargain ;
			ex:pleadGuiltyTo ex:Conspiracy ;
			ex:sentencedTo ex:Prison .

			ex:Rick_Gates ex:chargedWith ex:ForeignLobbying,
			ex:MoneyLaundering,
			ex:TaxEvasion ;
			ex:pleadGuiltyTo ex:Conspiracy,
			ex:LyingToFBI .

			</syntaxhighlight>

Sinoa: /* If you have more time... */

2023-01-24T09:45:34Z

If you have more time...

← Older revision		Revision as of 09:45, 24 January 2023
Line 42:		Line 42:
	==If you have more time...==		==If you have more time...==

	'''Task:''' Write a method (function) that starts with Donald Trump prints out a graph depth-first to show how the other graph nodes are connected to him. ~~For example,~~ the output could be:		'''Task:''' Write a method (function) that starts with Donald Trump prints out a graph depth-first to show how the other graph nodes are connected to him. An excerpt of the output could be:
	ex:Donald_Trump		ex:Donald_Trump
	<== ex:campaignManager ex:Paul_Manafort		<== ex:campaignManager ex:Paul_Manafort

Sinoa: /* Tasks */

2023-01-24T09:45:04Z

Tasks

← Older revision		Revision as of 09:45, 24 January 2023
Line 35:		Line 35:
	'''Task:''' It is possible to solve the task above without blank (or anonymous nodes). But to do so, you need to create a URI for each "instance of lying". This is a situation where blank nodes may be more suitable. Change your graph so it represents instances of lying as blank nodes.		'''Task:''' It is possible to solve the task above without blank (or anonymous nodes). But to do so, you need to create a URI for each "instance of lying". This is a situation where blank nodes may be more suitable. Change your graph so it represents instances of lying as blank nodes.

	'''Task:''' Save (''serialize'') your graph to a Turtle file. Add a few triples ''to the Turtle file''' with more information about Donald Trump. For example, you can add that Donald Trump is married to Melania and has several children. You can also use blank nodes to represent two of Trump's addresses when he was president:		'''Task:''' Save (''serialize'') your graph to a Turtle file. Add a few triples ''to the Turtle file'' with more information about Donald Trump. For example, you can add that Donald Trump is married to Melania and has several children. You can also use blank nodes to represent two of Trump's addresses when he was president:
	* The White House, 1600 Pennsylvania Ave., NW Washington, DC 20500, United States, phone: 1-202-456-1414		* The White House, 1600 Pennsylvania Ave., NW Washington, DC 20500, United States, phone: 1-202-456-1414
	* Mar-a-Lago Club, 1100 S Ocean Blvd, Palm Beach, FL 33480, United States		* Mar-a-Lago Club, 1100 S Ocean Blvd, Palm Beach, FL 33480, United States

Sinoa: /* If you have more time... */

2023-01-23T13:21:03Z

If you have more time...

← Older revision		Revision as of 13:21, 23 January 2023
Line 44:		Line 44:
	'''Task:''' Write a method (function) that starts with Donald Trump prints out a graph depth-first to show how the other graph nodes are connected to him. For example, the output could be:		'''Task:''' Write a method (function) that starts with Donald Trump prints out a graph depth-first to show how the other graph nodes are connected to him. For example, the output could be:
	ex:Donald_Trump		ex:Donald_Trump
	<-- ex:campaignManager ex:Paul_Manafort		<== ex:campaignManager ex:Paul_Manafort
	--> ex:convictedFor ex:BankAndTaxFraud		==> ex:convictedFor ex:BankAndTaxFraud
	...		...
	<-- ex:attorneyFor ex:Michael_Cohen		<== ex:attorneyFor ex:Michael_Cohen
	--> ex:pleadedGuilty ex:LyingToCongress		==> ex:pleadedGuilty ex:LyingToCongress

	Here, the <-- and --> arrows are printed to indicate the reverse of a property. We do that with a ''print()'' statement in Python, not from inside rdflib.		Here, the <== and ==> arrows are printed to indicate the reverse of a property. We do that with a ''print()'' statement in Python, not from inside rdflib.

	''Note:'' Because you must follow triples in both subject-to-predicate and predicate-to-subject direction, you must keep a list of already visited nodes, and never return to a previously visited one.		''Note:'' Because you must follow triples in both subject-to-predicate and predicate-to-subject direction, you must keep a list of already visited nodes, and never return to a previously visited one.

	''Note:'' If you want a neat solution, it may be best to combine two graph traversals: first traverse the model breadth-first to create a new tree-shaped model, and then traverse the tree-shaped model depth-first to print it out with indentation. (The point of the first breadth-first step is to find the shortest path to each node.)		''Note:'' If you want a neat solution, it may be best to combine two graph traversals: first traverse the model breadth-first to create a new tree-shaped model, and then traverse the tree-shaped model depth-first to print it out with indentation. (The point of the first breadth-first step is to find the shortest path to each node.)

Sinoa: /* Useful materials */

2023-01-23T13:17:22Z

Useful materials

← Older revision		Revision as of 13:17, 23 January 2023
Line 8:		Line 8:
	* [https://rdflib.readthedocs.io/en/stable/namespaces_and_bindings.html Namespaces and Bindings]		* [https://rdflib.readthedocs.io/en/stable/namespaces_and_bindings.html Namespaces and Bindings]
	* [https://rdflib.readthedocs.io/en/stable/intro_to_graphs.html Navigating Graphs]		* [https://rdflib.readthedocs.io/en/stable/intro_to_graphs.html Navigating Graphs]
	* [https://rdflib.readthedocs.io/en/stable/intro_to_parsing.html ~~Parsing~~]		* [https://rdflib.readthedocs.io/en/stable/intro_to_parsing.html Serialising and parsing]

	RDFlib classes/interfaces:		RDFlib classes/interfaces:

Sinoa: /* Tasks */

2023-01-20T17:35:45Z

Tasks

← Older revision		Revision as of 17:35, 20 January 2023
Line 27:		Line 27:
	** He pleaded guilty for lying to the FBI.		** He pleaded guilty for lying to the FBI.
	** He negotiated a plea agreement.		** He negotiated a plea agreement.
			If you want, you can try to use properties and types from standard vocabularies like FOAF (friend-of-a-friend) and DC (Dublin Core), but this is something we will look at in later exercises.

	'''Task:''' According to [https://www.pbs.org/wgbh/frontline/article/the-mueller-investigation-explained-2/ this FRONTLINE article], Gates', Cohen's and Flynn's lying were different and are described in different detail.		'''Task:''' According to [https://www.pbs.org/wgbh/frontline/article/the-mueller-investigation-explained-2/ this FRONTLINE article], Gates', Cohen's and Flynn's lying were different and are described in different detail.
Line 32:		Line 33:
	* How can you modify your knowledge graph to account for this?		* How can you modify your knowledge graph to account for this?

	'''Task:''' Save (''serialize'') your graph to a Turtle file. Add a few triples with more information about Donald Trump. Visualise the result if you want. Read (''parse'') the Turtle file back into a Python program, and check that the new triples are there.		'''Task:''' It is possible to solve the task above without blank (or anonymous nodes). But to do so, you need to create a URI for each "instance of lying". This is a situation where blank nodes may be more suitable. Change your graph so it represents instances of lying as blank nodes.

			'''Task:''' Save (''serialize'') your graph to a Turtle file. Add a few triples ''to the Turtle file''' with more information about Donald Trump. For example, you can add that Donald Trump is married to Melania and has several children. You can also use blank nodes to represent two of Trump's addresses when he was president:
			* The White House, 1600 Pennsylvania Ave., NW Washington, DC 20500, United States, phone: 1-202-456-1414
			* Mar-a-Lago Club, 1100 S Ocean Blvd, Palm Beach, FL 33480, United States
			Visualise the result if you want. Read (''parse'') the Turtle file back into a Python program, and check that the new triples are there.

	==If you have more time...==		==If you have more time...==

Sinoa: /* If you have more time... */

2023-01-20T17:24:10Z

If you have more time...

← Older revision		Revision as of 17:24, 20 January 2023
Line 38:		Line 38:
	'''Task:''' Write a method (function) that starts with Donald Trump prints out a graph depth-first to show how the other graph nodes are connected to him. For example, the output could be:		'''Task:''' Write a method (function) that starts with Donald Trump prints out a graph depth-first to show how the other graph nodes are connected to him. For example, the output could be:
	ex:Donald_Trump		ex:Donald_Trump
	^ex:campaignManager ex:Paul_Manafort		<-- ex:campaignManager ex:Paul_Manafort
	ex:convictedFor ex:BankAndTaxFraud		--> ex:convictedFor ex:BankAndTaxFraud
	...		...
	^ex:attorneyFor ex:Michael_Cohen		<-- ex:attorneyFor ex:Michael_Cohen
	ex:pleadedGuilty ex:LyingToCongress		--> ex:pleadedGuilty ex:LyingToCongress

	Here, the ^-~~sign is used~~ to indicate the reverse of a property.		Here, the <-- and --> arrows are printed to indicate the reverse of a property. We do that with a ''print()'' statement in Python, not from inside rdflib.

	''Note:'' Because you must follow triples in both subject-to-predicate and predicate-to-subject direction, you must keep a list of already visited nodes, and never return to a previously visited one.		''Note:'' Because you must follow triples in both subject-to-predicate and predicate-to-subject direction, you must keep a list of already visited nodes, and never return to a previously visited one.

	''Note:'' If you want a neat solution, it may be best to combine two graph traversals: first traverse the model breadth-first to create a new tree-shaped model, and then traverse the tree-shaped model depth-first to print it out with indentation. (The point of the first breadth-first step is to find the shortest path to each node.)		''Note:'' If you want a neat solution, it may be best to combine two graph traversals: first traverse the model breadth-first to create a new tree-shaped model, and then traverse the tree-shaped model depth-first to print it out with indentation. (The point of the first breadth-first step is to find the shortest path to each node.)

Sinoa at 14:03, 17 January 2023

2023-01-17T14:03:14Z

← Older revision		Revision as of 14:03, 17 January 2023
Line 5:		Line 5:
	RDFLib:		RDFLib:
	* [https://rdflib.readthedocs.io/en/stable/intro_to_creating_rdf.html Creating Triples]		* [https://rdflib.readthedocs.io/en/stable/intro_to_creating_rdf.html Creating Triples]
			* [https://rdflib.readthedocs.io/en/stable/rdf_terms.html RDF Terms]
			* [https://rdflib.readthedocs.io/en/stable/namespaces_and_bindings.html Namespaces and Bindings]
	* [https://rdflib.readthedocs.io/en/stable/intro_to_graphs.html Navigating Graphs]		* [https://rdflib.readthedocs.io/en/stable/intro_to_graphs.html Navigating Graphs]
	* [https://rdflib.readthedocs.io/en/stable/intro_to_parsing.html Parsing]		* [https://rdflib.readthedocs.io/en/stable/intro_to_parsing.html Parsing]