- Moreover, Herbrand's theorem states that if " S " is unsatisfiable then there is a finite unsatisfiable set of ground instances from the Herbrand universe defined by " S ".
- Second, a logic program with variables is viewed as shorthand for the set of all ground instances of its rules, that is, for the result of substituting variable-free terms for variables in the rules of the program in all possible ways.
- An abductive explanation of a problem " G " is a set of positive ( and sometimes also negative ) ground instances of the abducible predicates, such that, when these are added to the logic program P, the problem " G " and the integrity constraints IC both hold.
- It's difficult to find ground instance in a sentence. 用ground instance造句挺难的