A fact in Prolog is a function that returns a value.

A fact in Prolog is a variable that can change over time.

A fact in Prolog is a statement that asserts something is true, e.g., 'predicate(arguments).'.

A fact in Prolog is a comment that explains code.

A rule in Prolog is a data structure that stores facts.

A rule in Prolog is a logical statement that defines relationships between facts, consisting of a head and a body.

A rule in Prolog is a type of variable used in queries.

A rule in Prolog is a command that executes a program.

Backtracking is a method for optimizing database queries in Prolog.

Backtracking is a technique used to compile Prolog code into machine language.

Backtracking is a way to improve the performance of Prolog by using parallel processing.

Backtracking is a search strategy in Prolog that explores options and reverts to previous states when a dead end is reached.

Prolog variables can only hold numeric values.

Prolog uses variables as placeholders that can unify with terms during execution.

Prolog treats variables as constants throughout execution.

Prolog variables cannot be unified with any terms.

The cut operator in Prolog is used to control backtracking and commit to choices made.

The cut operator is used to print output to the console.

The cut operator is a method for optimizing memory usage.

The cut operator is used to define new predicates.

Prolog uses only numerical data to represent knowledge.

Knowledge in Prolog is represented solely through natural language descriptions.

Knowledge in Prolog is represented through facts, rules, and queries.

Knowledge in Prolog is represented through images and videos.

A predicate represents a relationship and can be true or false; a function computes a value.

A predicate is a function that always returns true; a function can only return false.

A predicate is used for arithmetic operations; a function is used for logical comparisons.

A predicate is a type of variable; a function is a constant value.

A list in Prolog is defined using curly braces, e.g., {element1, element2, element3}.

A list in Prolog is defined using parentheses, e.g., (element1, element2, element3).

A list in Prolog is defined using square brackets, e.g., [element1, element2, element3].

A list in Prolog is defined using angle brackets, e.g., .

Unification refers to the way Prolog handles memory management during execution.

Unification is the process of combining two Prolog programs into one.

Unification is a method for optimizing Prolog queries for faster execution.

Unification is the process of making two Prolog terms identical by finding substitutions for their variables.

Logic programming focuses solely on user interface design.

Logic programming is a method for creating mobile applications.

Logic programming is a programming paradigm that uses formal logic to express programs as a set of relations and rules.

Logic programming is a type of hardware programming.

Prolog uses explicit commands to control program flow.

Prolog requires manual memory management like imperative languages.

Prolog differs from imperative programming languages in that it is based on logic and rules rather than explicit commands and state changes.

Prolog is primarily focused on object-oriented programming principles.

Prolog is primarily used for numerical computations in AI.

Prolog is a graphical programming language for AI applications.

Prolog plays a significant role in artificial intelligence by enabling symbolic reasoning and knowledge representation.

Prolog is mainly focused on machine learning algorithms in AI.

A Prolog interpreter is a programming language.

A Prolog interpreter is a program that executes Prolog code.

A Prolog interpreter is a type of database.

A Prolog interpreter is a tool for compiling C code.

Prolog can represent and process natural language through symbolic reasoning and parsing.

Prolog is primarily used for numerical computations.

Prolog can only handle structured data, not language.

Prolog is a graphical programming language for visual applications.

The ':-' symbol signifies a rule or goal, indicating that the head is true if the body is true.

The ':-' symbol indicates a variable declaration.

The ':-' symbol is used for comments in Prolog.

The ':-' symbol represents a function call in Prolog.

Use only iterative loops to solve problems.

Define a base case and a recursive case in a predicate.

Define multiple base cases without recursion.

Create a single predicate without any conditions.

Prolog's reliance on imperative programming

Prolog's declarative nature, backtracking, rule-based support, natural language processing capabilities, and efficient recursion handling.

Inability to handle logical reasoning effectively

Limited support for complex data structures

A knowledge base in Prolog is solely for storing text documents.

A knowledge base in Prolog only contains numerical data.

A knowledge base in Prolog consists of facts and rules that represent information and enable logical reasoning.

A knowledge base in Prolog is a collection of user preferences.

The 'assert' predicate is used for debugging, while 'retract' is for optimization.

The 'assert' predicate removes facts/rules, and the 'retract' predicate adds them.

Both 'assert' and 'retract' are used to query existing facts.

The 'assert' predicate adds facts/rules, and the 'retract' predicate removes them.