[[http://en.wikipedia.org/wiki/Datalog|Datalog]] is a [[http://en.wikipedia.org/wiki/Turing_completeness|non-Turing-complete]] subset of Prolog that is best at :
* managing large sets of related information (e.g. in data integration or the semantic web).
* simulating intelligent behavior (for games),
-* performing recursive algorithms (e.g. in graph analysis)
+* performing recursive algorithms (e.g. in graph analysis)
Datalog statements can be specified in any order, eliminating the need for [[http://en.wikipedia.org/wiki/Sequence_diagram|sequence analysis]] and the associated risk of tricky errors. Datalog programs are often shorter than their python equivalent.