Automated Inference for FOL
- Automated inference using FOL is harder than using PL because
variables can take on potentially an infinite number of possible
values from their domain.
- Godel's Completeness Theorem says that FOL entailment is only
semidecidable. That is, if a sentence is true given a set of
axioms, there is a procedure that will determine this. However,
if the sentence is false, then there is no guarantee that a
procedure will ever determine this.
- The Truth Table method of inference is not complete for FOL
because the truth table size may be infinite