Question 1

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

Accepted Answer

A) True 
 B)False  True

Question 2

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

Accepted Answer

A) True 
 B)False  True

Question 3

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

Accepted Answer

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

Question 4

In Prolog,the cut operator is used to ____.

Accepted Answer

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 
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 5

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

Accepted Answer

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

Question 6

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

Accepted Answer

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

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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 ____.

Accepted Answer

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

Question 9

Logical statements can be either true or false.

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

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

Question 11

Prolog is the most widely used logic programming language.

Accepted Answer

A) True 
 B)False

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

Every logical statement can be turned into Horn clauses.

Accepted Answer

A) True 
 B)False

Question 14

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

Accepted Answer

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

Question 15

The semantics of programming language constructs is called ____.

Accepted Answer

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

Question 16

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

Accepted Answer

A) True 
 B)False

Question 17

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

Accepted Answer

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

Question 18

Most Prolog systems are run as interpreters,not compilers.

Accepted Answer

A) True 
 B)False

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

Horn clauses cannot be given a procedural interpretation.

Accepted Answer

A) True 
 B)False

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

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

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

In Prolog,the cut operator is used to ____.

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

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

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

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 ____.

Logical statements can be either true or false.

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

Prolog is the most widely used logic programming language.

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

Every logical statement can be turned into Horn clauses.

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

The semantics of programming language constructs is called ____.

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

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

Most Prolog systems are run as interpreters,not compilers.

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

Horn clauses cannot be given a procedural interpretation.

Introduction

Language Design Criteria

Functional Programming

Object-Oriented Programming

Syntax

Basic Semantics

Data Types

Control I - Expressions and Statements

Control II - Procedures and Environments

Abstract Data Types and Modules

Formal Semantics

Parallel Programming

Filters

Exam 4: Logic Programming

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

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

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

In Prolog,the cut operator is used to ____.

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

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

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

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 ____.

Logical statements can be either true or false.

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

Prolog is the most widely used logic programming language.

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

Every logical statement can be turned into Horn clauses.

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

The semantics of programming language constructs is called ____.

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

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

Most Prolog systems are run as interpreters,not compilers.

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

Horn clauses cannot be given a procedural interpretation.

Introduction

Language Design Criteria

Functional Programming

Object-Oriented Programming

Syntax

Basic Semantics

Data Types

Control I - Expressions and Statements

Control II - Procedures and Environments

Abstract Data Types and Modules

Formal Semantics

Parallel Programming

Filters