Picat Tabling for Memoization Questions and Answers

Question 1

A programmer is writing a Picat function to calculate Fibonacci numbers, which is notoriously inefficient due to repeated calculations of the same subproblems.
Which Picat directive should be used to automatically memoize the results of the function calls and significantly improve performance?

Accepted Answer

table

Answer

memoize

Answer

cache

Answer

store

Question 2

Consider the following Picat code for finding a path in a graph. Without tabling, this code could enter an infinite loop if the graph contains cycles. How does adding the `table` directive prevent this issue?

```picat
path(X, Y) => edge(X, Y).
path(X, Y) => path(X, Z), edge(Z, Y).
```

Accepted Answer

It memorizes calls to `path/2` and reuses answers, preventing re-exploration of the same subgoals.

Answer

It limits the recursion depth to a predefined maximum.

Answer

It converts the recursive predicate into an iterative loop.

Answer

It throws an exception when a cyclic path is detected.

Question 3

Which of the following is the primary benefit of using tabling in Picat for dynamic programming problems?

Accepted Answer

It changes the asymptotic time complexity of algorithms with overlapping subproblems from exponential to polynomial/linear.

Answer

It automatically parallelizes the computation across multiple CPU cores.

Answer

It simplifies file I/O operations by caching disk reads.

Answer

It enforces strict type checking on recursive functions to prevent errors.

Question 4

A developer needs to find the shortest path in an unweighted graph and decides to use tabling. They want Picat to automatically keep only the answer with the minimum path length for any given pair of nodes. Which feature of Picat's tabling system would be most suitable for this scenario?

Accepted Answer

Mode-directed tabling.

Answer

The standard `table` directive.

Answer

A `foreach` loop with a manually managed minimum variable.

Answer

The `planner` module without any special directives.

Question 5

Which of the following statements about Picat's tabling mechanism is FALSE?

Accepted Answer

It requires manual cache invalidation using a special built-in predicate.

Answer

It can be applied to both predicates and functions.

Answer

It is implemented using a technique called linear tabling.

Answer

The `table` keyword is placed immediately before the first rule of the predicate/function to be tabled.

Question 6

A developer is using tabling to optimize a function but notices that values from previous, unrelated runs of the program seem to be affecting the current results. What is the most likely cause and solution?

Accepted Answer

The table area was not cleared from a previous run; call `initialize_table` at the start of the program.

Answer

The `table` directive is misspelled; it should be `memoize`.

Answer

The function is non-deterministic, and tabling only works on deterministic functions.

Answer

A destructive assignment operator (`:=`) is being used inside the tabled function, which is not allowed.

A programmer is writing a Picat function to calculate Fibonacci numbers, which is notoriously inefficient due to repeated calculations of the same subproblems.Which Picat directive should be used to automatically memoize the results of the function calls and significantly improve performance?

A programmer is writing a Picat function to calculate Fibonacci numbers, which is notoriously inefficient due to repeated calculations of the same subproblems.
Which Picat directive should be used to automatically memoize the results of the function calls and significantly improve performance?