Graphs in PROLOG Adam Volk PROLOG Introduction Programmer tells - - PowerPoint PPT Presentation

▶

Sep 09, 2022 129 likes •222 views

Graphs in PROLOG Adam Volk PROLOG Introduction Programmer tells the system what to find, not how to find it 2 parts to using PROLOG Declaration of facts and rules Asking questions dependent on those facts and rules Pattern

SLIDE 1

Graphs in PROLOG

Adam Volk

SLIDE 2

PROLOG Introduction

Programmer tells the system what to find, not how to find it
2 parts to using PROLOG
Declaration of facts and rules
Asking questions dependent on those facts and rules
Pattern matching key!
Example

SLIDE 3

Problem Considered

PROLOG implementation of graphs
G = (Vertices, Edges)
G = ( {x,y,z} , {(x,y), (y,z), (x,z)} )
graph( [ [x,y,z], [ [x,y],[y,z],[x,z] ] ] ).

SLIDE 4

Methods Studied

graph(G)
vertex(G,V)
edge(G,E)
complete(G)
has_cycle(G,V)
chain(G,Start,End,Chain)
tree (G)
outdegree(G,V)

Complete graph K5

SLIDE 5

Methods Studied

graph(G)
vertex(G,V)
edge(G,E)
complete(G)
has_cycle(G,V)
chain(G,Start,End,Chain)
tree (G)
outdegree(G,V)

Complete graph K5

SLIDE 6

Demo

SLIDE 7

Thank you

SLIDE 8

References

Bratko, I., Programming in Prolog for Artificial Intelligence, 4th Edition.

Addison-Wesley, 2011, chapters 1-5.

Matuszek, D., A Concise Introduction to Prolog.
Pereira, F., A Brief Introduction to Prolog. ACM Digital Library.