AI & Logic Flashcards

1
Q

An agent passes a Turing test if

A

a human interrogator, after posing some written questions, cannot tell whether the written responses come from a person or from a computer

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

Dall-E’s ability to generate an appropriate fill-in around a picture is called

A

outpainting

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

AlphaFold predict

A

Protein Folding

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

Rationality

A

An alternative approach in AI to mimicking human intelligence

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

Machine learning

A

an alternative approach to symbolic AI for prediction is about techniques to train from data to predict classes of new instances

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

Two primary Types of semantics in First-order Predicate

A

Model
Proof

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

the domain

A

The set of object in the environment that are important for your application in logic

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

The Unique Name Assumption

A

Φ(t) = t (where Φ is the pre-interpretation)

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

AI is

A

A. the simulation of human intelligence by machines.
B. automated reasoning for problem solving.
C. computation to achieve goals in the world.
D. the design of algorithms designed to make decisions.

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

Percept

A

is something an agent perceives about the environment

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

Declarative programming paradigm

A

States what the program is meant to do, but not how to do it.

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

How does Prolog evaluates?

A

rules from top to bottom, goals from left to right.

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

Query

A

Is a question or request for information based on certain conditions or criteria

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

Proof by refutation

A

Is a type of proof by contradiction

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

Tail recursion

A

Is when the predicate of the atom in the head of the clause only appears at the end of the body of the clause

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

locally stratified

A

It has a perfect model

17
Q

Occurrence Check

A

Is a process that ensures that a variable does not appear within itself during unification.

18
Q

Unification

A

Binding of variables to terms

19
Q

Horn

A

At most one positive atom per

20
Q

Closed-world assumption

A

Assume false if not true

21
Q

Backtracking

A

Trying a different inference

22
Q

Non-monotonic negation

A

As finite failure to find proof