Factual/Declarative Knowledge and Propositional Networks

Declarative knowledge is knowledge that we can talk about (notes).  Based on this knowledge we know that “something is the case” when applying Dijkstra’s algorithm to find the shortest path/cost between two nodes. This type of knowledge can be represented through propositional networks, which connect the concepts and objects involved in Dijkstra’s algorithm.

1^st proposition:

Dijkstra’s Algorithm (isa, optimization method, Graph/Network of Nodes)

In this proposition isa is the pointer that defines Dijkstra’s Algorithm both as an optimization method and a network of nodes.

2^nd proposition:

Dijkstra’s Algorithm (compute, shortest distance, lowest cost, shortest time)

This proposition indicates the uses of Dijkstra’s Algorithm. Shortest distance, lowest cost and shortest time are the concepts, and compute is the pointer that explains what Dijkstra’s Algorithm is used for.

3^rd proposition:

Running time (affect, Dijkstra’s Algorithm)

This proposition explains that one of the factors that affect Dijkstra’s Algorithm is the running time, which is how long it takes to complete the algorithm. Because the running time is greater then zero, since the algorithm needs to take place, this is a factor that will have a negative influence.

4^th proposition:

Shortest distance (used by, Online routing systems, GPS units)

This sentence points out the entities that make use of the concept of shortest distance.

5^th proposition:

Google Maps, Mapquest (type of, online routing system)

This proposition explains that the entities Google Maps and Mapquest are types of online routing systems.

6^th proposition:

Tom Tom, Garmin (type of, GPS units)

This proposition explains that the entities Tom Tom and Garmin are types of GPS units.

7^th proposition:

Lowest Cost (used by, Economists, Investment Bankers, Flight booking systems)

This is a positive relation, which uses the pointer used by to indicate that the concept of lowest cost is used by economists, investment bankers, flight booking systems.

8^th proposition:

Expedia, BookIt (type of, flight booking system)

This proposition uses the pointer type of to connect the concept of booking system with the instances Expedia and BookIt.

9^th proposition:

Shortest time (used by, flight booking system)

This proposition indicates that the concept of shortest time is used by flight booking systems.