You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+1-2Lines changed: 1 addition & 2 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -120,8 +120,7 @@ The PROLOG programming language can be used to prove seemingly arbitrary stateme
120
120
world applications, but it's not mathematically pure. `FirstOrderLogic.jl` uses a direct
121
121
mathematical syntax for expressing formulas.
122
122
* Expressive power: PROLOG works on a limited set of all valid formulas in first-order logic, namely
123
-
only formulas that can be expressed as a conjunction of [horn clauses]
124
-
(https://en.wikipedia.org/wiki/Horn_clause). This is sufficient for many real world applications,
123
+
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,
125
124
but it's not mathematically complete. PROLOG thereby trades completeness for computation time.
126
125
`FirstOrderLogic.jl` does not make that trade. It is slow, but complete.
0 commit comments