Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

CIS 424 > CH 16 > Flashcards

CH 16 Flashcards

1
Q

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

A

Symbolic Logic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Predicate Calculus

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Terms that represent the object representation:

A

Constant and Variable

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Constant

A

Symbol that represents an object.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Variable

A

Symbol that represents different objects at different times.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Atomic Propositions

A

Consist of compound terms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Compound terms

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Parts of the Compound term

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Forms of propositions:

A

Fact & Query

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Compound proposition:

A

two or more atomic propositions
propositions are connected by operators

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Antecedent

A

Right side

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Consequent

A

Left Side

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Usage of Propositions:

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Resolution

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Unification

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Instantiation

A

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

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

If matching process fails during unification, we may need to

A

backtrack

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

Proof By contadiction

A

This theorem is proved by finding an inconsistency.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

Hypotheses

A

A set of pertinent propositions

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

Forms of Horn Clause

A

Headed: single atomic proposition on LHS

Headless: Empty LHS (facts)

21
Q

Declarative Semantic

A

Simple way to determine the meaning of each statement.

22
Q

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

A

N/A

23
Q

University of Aix-Marseille for the origins of the Prolog

A

Natural Language Processing

24
Q

University of Edinburgh

A

Automated Theorem Proving

25
Q

Term

A

Constant
Variable
Structure

26
Q

Constant (Edinburgh Syntax of the Prolog)

A

An atom or an integer

27
Q

Atom (Edinburgh Syntax of the Prolog)

A

Sumbolic value of the Prolog

28
Q

Atoms consist of:

A

a string of letters, digits, underscores beginning with the lowercase letter.

a string of printable ASCII characters delimited by the apostrophes

29
Q

Variable (Edinburgh Syntax for the Prolog)

A

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

30
Q

Structure (Edinburgh Syntax for the Prolog)

A

Represents an atomic proposition

functor(parameter list)

31
Q

Rule Statements

A

Headed Horn Clause
For Hypotheses

32
Q

Conjunction

A

Multiple terms separated by logical AND operations

33
Q

Goal Statements

A

In form of propositons to prove or disprove.

Headless Horn

34
Q

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

A

subgoal.

35
Q

Matching/Satisfying/Resolution

A

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

36
Q

Matching

A

Process of proving a proposition

37
Q

Approaches to the Matching:

A

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)

38
Q

Prolog implementations uses ___________

A

backward chaining

39
Q

When goal has more than one subgoal,

A

Depth-first search: find a complete proof of the first subgoal than others

Breadth-first search: work on all the subgoals in parallel

40
Q

Disadvantages of Backtracking:

A

Consumes large amount of time and space

41
Q

Prolog supports

A

integer var and intger arithmetic

42
Q

is operator

A

arithmetic expression == right operand
Variable == left operand

43
Q

Is ‘is operator’ equal to the assignment operator?

A

Not

44
Q

TRACE

A

Built in structure that displays instantions at each step.

45
Q

Events in TRACE:

A

Call
Exit
Redo
Fail

46
Q

List Structure

A

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

47
Q

The underscore character in list means:

A

an anonymous variable

48
Q

Deficiencies of Prolog

A

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)

49
Q

Applications of Logic Programming

A

Relational Database management systems

Expert Systems

Natural Language Processing

CIS 424 (2 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions