How does FormulaOne compare to Prolog?
There are many flavors and implementations of Prolog, so it is not easy to answer the question. Syntactically FormulaOne and Prologs are completely different. For a non-Prolog programmer it is much easier to read and follow F1 source code than to read and follow Prolog source code. Comparing the performance is not easy, as there are no official nor widely used logic programming benchmarks. The few (rather obsolete) benchmarks we are aware of consist of some simple list manipulations, which obviously do not benchmark anything of any importance to logic programming. Since there are only a limited number of list operations, most implementations should produce more-less the same benchmark results. These benchmarks reflect the power of CPUs more than anything else. There is another way to compare performance: solve the same problem with various compilers (using the same CPU) and compare the execution time. This is not quite cut-and-dry either: the problems should have at least some complexi
