> for example you can map all the example in the parent article to SQL pretty easily How would you map the map coloring example? You can model the color table

> for example you can map all the example in the parent article to SQL pretty easily How would you map the map coloring example? You can model the color table and the neighbor table in SQL, but that's just the data model. What Prolog also gives you is backtracking search. Is there a good way to do that in SQL? I guess it would work by computing the Cartesian product of states and colors and trying a select on that... > You specify a world as a set of tuples and determine whether one set of relations determines another set of relations. That lets you do essentially what prolog can do Datalog, maybe, if you have the search mentioned above. Not Prolog, though: Prolog has terms with free variables and unification. Those have no simple "database" interpretation. The featured article only shows off a small (non-recursive, negation-free) fragment of a Datalog-like language, which itself is only a small (function-free) fragment of Prolog. You can't make broad claims about Prolog from this small set of examples.