Exam 4: Logic Programming

In predicate calculus,arguments to predicates and functions can only be terms - that is,combinations of ____.

Logic programming systems are sometimes referred to as ____.

Programs known as automatic deduction systems ____.

The statements a → b and b → c then a → c are an example of a typical inference rule.

The process of unification can be used to shorten clauses.

Prolog applies resolution in a strictly linear fashion,replacing goals from left to right.

____ takes the perspective that a program describes what the solution to a problem is,not how that problem is solved.

The kind of logic used in logic programming is lambda calculus.

Theorems are derived from axioms.

Resolution is an especially inefficient inference rule for Horn clauses.

____ are statements that are assumed to be true and from which other true statements can be proved.

Horn clauses of the form →b are sometimes referred to as ____.

The ____ quantifier represents all things in the universe named by the variable.

An example of a Horn clause is a₁ and a₂ and a₃ →b.

Statements that can be derived from the logic program are known as queries or goals.

Prolog is vulnerable to infinite loops because it uses a depth-first search.

Prolog completely satisfies the original goal of logic programming.

Most logic programming systems restrict themselves to a particular subset of predicate calculus called ____.

Variables set equal to patterns are said to be ____.

A variable introduced by a quantifier is said to be free and not bound by the quantifier