CH 16

Question 1

Logic that can be used for the basic needs of the formal logic:

Answer 1

Symbolic Logic

Question 2

Predicate Calculus

Answer 2

Particular form of the symbolic logic that is used for the logic programming.

Question 3

Terms that represent the object representation:

Answer 3

Constant and Variable

Question 4

Constant

Answer 4

Symbol that represents an object.

Question 5

Variable

Answer 5

Symbol that represents different objects at different times.

Question 6

Atomic Propositions

Answer 6

Consist of compound terms

Question 7

Compound terms

Answer 7

One element of mathematical relation, written like a mathematical function (mapping and can be written as a table)

Question 8

Parts of the Compound term

Answer 8

Functor (a function symbol that names the relationship); Ordered list of params (tuple)

Question 9

Forms of propositions:

Answer 9

Fact & Query

Question 10

Compound proposition:

Answer 10

two or more atomic propositions
propositions are connected by operators

Question 11

Antecedent

Answer 11

Right side

Question 12

Consequent

Answer 12

Left Side

Question 13

Usage of Propositions:

Answer 13

To discover new theorems that can be inferred from the known axioms and theorems.

Question 14

Resolution

Answer 14

An inference principle that allows inferred propositions to be computed from the given propositions.

Question 15

Unification

Answer 15

Finding the values for the variables in the propositions that allows matching process to succeed.

Question 16

Instantiation

Answer 16

Assigning temporary values to the variables to allow unification to succeed.

Question 17

If matching process fails during unification, we may need to

Answer 17

backtrack

Question 18

Proof By contadiction

Answer 18

This theorem is proved by finding an inconsistency.

Question 19

Hypotheses

Answer 19

A set of pertinent propositions

Question 20

Forms of Horn Clause

Answer 20

Headed: single atomic proposition on LHS

Headless: Empty LHS (facts)

Question 21

Declarative Semantic

Answer 21

Simple way to determine the meaning of each statement.

Question 22

Describing the characterstics of the sorted list rather than the process of rearranging the list.

Answer 22

N/A

Question 23

University of Aix-Marseille for the origins of the Prolog

Answer 23

Natural Language Processing

Question 24

University of Edinburgh

Answer 24

Automated Theorem Proving

Question 25

Term

Answer 25

Constant Variable Structure

Question 26

Constant (Edinburgh Syntax of the Prolog)

Answer 26

An atom or an integer

Question 27

Atom (Edinburgh Syntax of the Prolog)

Answer 27

Sumbolic value of the Prolog

Question 28

Atoms consist of:

Answer 28

a string of letters, digits, underscores beginning with the lowercase letter. a string of printable ASCII characters delimited by the apostrophes

Question 29

Variable (Edinburgh Syntax for the Prolog)

Answer 29

Any string of letters, digits, and underscore beginning with the uppercase letter

Question 30

Structure (Edinburgh Syntax for the Prolog)

Answer 30

Represents an atomic proposition functor(parameter list)

Question 31

Rule Statements

Answer 31

Headed Horn Clause For Hypotheses

Question 32

Conjunction

Answer 32

Multiple terms separated by logical AND operations

Question 33

Goal Statements

Answer 33

In form of propositons to prove or disprove. Headless Horn

Question 34

If a goal is a compound proposition, each of the facts is a

Answer 34

subgoal.

Question 35

Matching/Satisfying/Resolution

Answer 35

Process of proving a subgoal when a goal is the compound proposition.

Question 36

Matching

Answer 36

Process of proving a proposition

Question 37

Approaches to the Matching:

Answer 37

Top-Down resolution: from goal to the sequence that leads to facts in the database. (For a small set of possibly correct answers) Bottom-Up Resolution: from the facts and goals in the databse to the sequence that leads to goal. (For a large set of possibly correct answers)

Question 38

Prolog implementations uses ___________

Answer 38

backward chaining

Question 39

When goal has more than one subgoal,

Answer 39

Depth-first search: find a complete proof of the first subgoal than others Breadth-first search: work on all the subgoals in parallel

Question 40

Disadvantages of Backtracking:

Answer 40

Consumes large amount of time and space

Question 41

Prolog supports

Answer 41

integer var and intger arithmetic

Question 42

is operator

Answer 42

arithmetic expression == right operand Variable == left operand

Question 43

Is 'is operator' equal to the assignment operator?

Answer 43

Not

Question 44

TRACE

Answer 44

Built in structure that displays instantions at each step.

Question 45

Events in TRACE:

Answer 45

Call Exit Redo Fail

Question 46

List Structure

Answer 46

Sequence of any number of elements (can be any atom or atomic proposition, or other terms)

Question 47

The underscore character in list means:

Answer 47

an anonymous variable

Question 48

Deficiencies of Prolog

Answer 48

Lack of Resolution order control: nondeterministic order of the attempted matches. The closed-world assumption: The only knowledge is what is in databse. The negation problem: Anything not stated in the database is assumed to be false. Intrinsic Limitations: Easy to sort a process in the logic, but it is difficult to actually do (don't know how to sort)

Question 49

Applications of Logic Programming

Answer 49

Relational Database management systems Expert Systems Natural Language Processing