PROLOG 2 Flashcards

(30 cards)

1
Q

The year the name ‘Prolog’ was officially invented in Marseilles.

A

1972

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

The full French phrase that the abbreviation ‘Prolog’ stands for.

A

PROgrammation en LOGique

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

The specific researcher who chose the name ‘Prolog’.

A

Philippe Roussel

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

The programming language used to implement the very first Prolog interpreter, Prolog 0.

A

ALGOL-W

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

The 1965 principle introduced by J.A. Robinson that serves as the theoretical foundation for Prolog.

A

Resolution Principle

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

The specific subset of first-order logic that can be executed efficiently and is used in Prolog.

A

Horn Clauses

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

The restricted form of resolution demonstrated by Robert Kowalski that treats logic clauses as procedure definitions.

A

SL-resolution (or Linear resolution with Selection function)

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

The researcher who formulated the famous equation $Algorithm = Logic + Control$.

A

Robert Kowalski

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

The primary control strategy used in the first Prolog interpreter, chosen due to memory constraints of the time.

A

Depth-first search with backtracking

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

The most recently officially recognized core ISO standard for Prolog, published in 1995.

A

ISO/IEC 13211-1:1995

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

The powerful formalism used in natural language processing that was formally standardized in June 2025.

A

Definite Clause Grammars (DCGs)

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

The implementation version of SWI-Prolog mentioned as the latest stable open-source release.

A

Version 10.0

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

The 1973 prototype (Prolog I) that first introduced this operator for control.

A

Cut operator (!)

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

The dialect released in 1982 that replaced standard unification with equation solving over infinite (rational) trees.

A

Prolog II

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

The first system to fully realize the vision of Constraint Logic Programming (CLP) in 1990.

A

Prolog III

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

The dialect that established the standard “Edinburgh Syntax,” including capitalized variables.

A

DEC-10 Prolog

17
Q

The first version of Prolog designed specifically for 8-bit microcomputers using Z80 Assembly.

A

LPA Prolog (or micro-PROLOG)

18
Q

The abstract memory model and instruction set that modern Prolog implementations like SWI-Prolog are built upon.

A

Warren Abstract Machine (WAM)

19
Q

The primary programming language used to implement the SWI-Prolog virtual machine for portability.

20
Q

The specific classification of SWI-Prolog that refers to its ability to modify its own database at runtime.

A

Dynamic language

21
Q

The initial motivation for developing Prolog was for general-purpose computing.

A

False (The initial motivation was the processing of natural language)

22
Q

Alain Colmerauer is widely recognized as the creator of Prolog.

23
Q

In Kowalski’s $Algorithm = Logic + Control$ equation, the logic component is the strategy used to solve the problem.

A

False (The control component is the strategy used to solve it)

24
Q

SWI-Prolog version 10.0 introduces native GUI tools based on SDL3 and Cairo.

25
Prolog 0 omitted the "occurs check" to ensure linear-time unification speed.
True
26
Unix Prolog (1979) adopted "structure copying" to suit 16-bit address spaces, which later influenced the WAM.
True
27
SWI-Prolog is a single-threaded environment and cannot utilize modern multi-core CPUs.
False (It supports multi-threading and maps Prolog threads to native OS threads)
28
One of the primary modern application areas for SWI-Prolog is the Semantic Web and Knowledge Graphs.
True
29
Prolog is primarily classified as an imperative programming language.
False (It is classified as a Declarative Logic Programming Language)
30
The execution model of SWI-Prolog is a hybrid system that utilizes bytecode compilation.
True