Deck 4: Logic Programming

Question 1

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

Answer 1

True

Question 2

Automated deduction systems have difficulty handling all of first-order predicate calculus.

Answer 2

True

Question 3

Horn clauses can be viewed as specifications of procedures rather than strictly as implementations.

Answer 3

True

Question 4

Logic programming uses second-order predicate calculus.

Question 5

Theorems are derived from axioms.

Question 6

The existential quantifier is used to represent all things in the universe that exist.

Question 7

A logic programming language is a notational system for writing logical statements together with specified algorithms for implementing inference rules.

Question 8

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

Question 9

Horn clauses cannot be given a procedural interpretation.

Question 10

The ISO standard for Prolog standardized the responses from a Prolog interpreter.

Question 11

Prolog is the most widely used logic programming language.

Question 12

Logical statements can be either true or false.

Question 13

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

Question 14

In Prolog,arithmetic terms can be written in either infix notation or prefix notation.

Question 15

Resolution is an especially inefficient inference rule for Horn clauses.

Question 16

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

Question 17

In Prolog,you can specify the head and tail of a list using a backslash.

Question 18

Most Prolog systems are run as interpreters,not compilers.

Question 19

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

Question 20

Logical statements can be used as formal specifications for the required behavior of programs.

Question 21

The semantics of programming language constructs is called ____.

A) logic statements
B) axiomatic semantics
C) syntax
D) specifications

Question 22

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

A) queries
B) axioms
C) connectives
D) facts

Question 23

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

Question 24

Every logical statement can be turned into Horn clauses.

Question 25

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

A) existential
B) universal
C) global
D) general

Question 26

In the Horn clause a₁ and a₂ and a₃ → b,the portion a₁ and a₂ and a₃ is called the ____.

A) head
B) body
C) tail
D) query

Question 27

Prolog completely satisfies the original goal of logic programming.

Question 28

In the Horn clause a₁ and a₂ and a₃ → b,the variable b is called the ____.

A) head
B) body
C) tail
D) fact

Question 29

A(n)____ quantifier states that a predicate is true of at least one thing in the universe,indicated by the variable.

A) existential
B) universal
C) global
D) logical

Question 30

The specific path that an automatic deduction system chooses to derive a statement is the ____ for a logic programming system.

A) axiom
B) theorem
C) control problem
D) deductive database

Question 31

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

A) axiomatic clauses
B) algorithms
C) Horn clauses
D) control clauses

Question 32

Programs known as automatic deduction systems ____.

A) solve logic questions
B) determine equality
C) make choices based on input data
D) turn proofs into computation

Question 33

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

A) Axioms
B) Predicates
C) Logical statements
D) Universal statements

Question 34

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

A) predicates and connectives
B) constants and predicates
C) variables, constants, and functions
D) predicates, quantifiers, and connectives

Question 35

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

Question 36

____ is the process of pattern matching to make statements identical.

A) Unification
B) Resolution
C) Instantiation
D) Equalization

Question 37

Prolog programs use a particular kind of grammar rules called ____.

A) definite clause grammars
B) procedural clause grammars
C) axiom clause grammars
D) reverse clause grammars

Question 38

Logic programming systems are sometimes referred to as ____.

A) logic queries
B) deductive databases
C) derivative databases
D) successional databases

Question 39

The set of logical statements that are taken to be axioms can be viewed as the ____.

A) baseline
B) logic program
C) theorem
D) control statement

Question 40

The process of unification can be used to shorten clauses.

Question 41

A list is written in Prolog using ____ to enclose the items.

A) curly braces
B) square brackets
C) single quotes
D) double quotes

Question 42

The closed-world assumption is that all solutions ____ or are assumed false.

A) must be finite
B) must be rational
C) must be proved true
D) must be limited to a closed solution set

Question 43

In Prolog,the cut operator is used to ____.

A) stop a search of a tree
B) move a node from one tree to another
C) remove a node from a tree
D) prune duplicates from a tree

Question 44

To force evaluation of an arithmetic term in Prolog,you must use the built-in predicate ____.

A) force
B) evaluate
C) equals
D) is

Question 45

Variables set equal to patterns are said to be ____.

A) unified
B) instantiated
C) initialized
D) resolved

Question 46

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

A) Interpretive programming
B) Resolution
C) Declarative programming
D) Unification

Question 47

____ Prolog was used as the basis for the Prolog ISO standard.

A) Resolution
B) Horn
C) Unification
D) Edinburgh

Question 48

Nonmonotonic reasoning is that adding information to a system can ____.

A) decrease the complexity
B) alter the previous information
C) change the order of execution
D) reduce the number of things that can be proved

Question 49

To force Prolog to perform loops and repetitive searches,we must force backtracking even when a solution is found by using the built-in predicate ____.

A) is
B) fail
C) parent
D) repeat

Question 50

Prolog uses ____.

A) lowercase for variable names, and uppercase for constants and functions
B) uppercase for variable names, and lowercase for constants and functions
C) lowercase for variable names and constants, and uppercase for functions
D) uppercase for variable names and constants, and lowercase for functions