When reasoning based on a set of sentences of the form "if A then usually B", classical logical system will not suffice. The use of ranking functions, that assign a degree of implausibility to every possible world is a popular approach to allow plausible relationships as logical formulas. A well known way of generating such a ranking function based on a set of plausible relationships is System Z.
During this talk, you will discover System Z as an example to show, how language features such as list comprehensions and higher order functions can be used to quickly implement a running prototype of a complex formal system.
YOU MAY ALSO LIKE:
Commonsense Reasoning using Haskell
Steven has a Master of Computer Science at the Trier University of Applied Sciences and is currently a Research assistant at the University of Hagen in the area of knowledge based systems.