From bbfbaf7a2e45451f695afe62082fd1f51481bbb1 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Robert=20H=C3=B6nig?= Date: Fri, 16 Mar 2018 16:31:29 -0400 Subject: [PATCH] README.md: Fix malformatted hyperlink. --- README.md | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/README.md b/README.md index 10cb451..f345a91 100644 --- a/README.md +++ b/README.md @@ -120,8 +120,7 @@ The PROLOG programming language can be used to prove seemingly arbitrary stateme world applications, but it's not mathematically pure. `FirstOrderLogic.jl` uses a direct mathematical syntax for expressing formulas. * Expressive power: PROLOG works on a limited set of all valid formulas in first-order logic, namely - only formulas that can be expressed as a conjunction of [horn clauses] - (https://en.wikipedia.org/wiki/Horn_clause). This is sufficient for many real world applications, + only formulas that can be expressed as a conjunction of [horn clauses](https://en.wikipedia.org/wiki/Horn_clause). This is sufficient for many real world applications, but it's not mathematically complete. PROLOG thereby trades completeness for computation time. `FirstOrderLogic.jl` does not make that trade. It is slow, but complete.