Term
| Three primary uses of symbolic logic in formal logic: |
|
Definition
| To express propositions, To express the relationships between propositions, To describe how new propositions can be inferred from other propositions that are assumed to be true |
|
|
Term
| Two parts of a compound term |
|
Definition
Functor: function symbol that names the relation (loves)
Ordered list of paramters ("mike", "PL) |
|
|
Term
| General form of proposition in clausal form: |
|
Definition
Right side: Antecedent,
Left side: Consequent |
|
|
Term
|
Definition
| Single atomic proposition (RULE), No consequent (FACT) |
|
|
Term
|
Definition
| That there is a simple way to determine the meaning of each statement, and it does not depend on how the statement might be used to solve a problem. |
|
|
Term
| Three forms of a Prolog term: |
|
Definition
| constant (lowercase), variable (uppercase), structure (functor(params)) |
|
|
Term
|
Definition
| things known to be true (FORM: female(Ryan).) |
|
|
Term
|
Definition
| if not stated, then not true |
|
|
Term
|
Definition
| general truths by inference (FORM: parent(X, Y) :- mother(X, Y).) |
|
|
Term
| Approaches to attempting to match a goal |
|
Definition
forward chaining: take goal and find sequence in goal.
backward chaining: take goal find sequences in database. |
|
|
Term
|
Definition
| backing up in the goal to the reconsideration of a previously proven subgoal |
|
|
Term
|
Definition
| inferrence rule, that allows inferred propostions to be computed from given propositions |
|
|
Term
|
Definition
| process of determining useful values for variables. |
|
|
Term
| Prolog negation problem in prolog |
|
Definition
| can't skip already used facts in database, to must must have a facts to determing "same" for every fact. |
|
|
Term
| Goal of logic programming |
|
Definition
| provide nonprocedural programming: a system by which programmers specify what a program is supposed to do but need not specifiy how that is to be accomplished |
|
|
