# Question

In this exercise, we will look at sorting in Prolog.

a. Write Prolog clauses that define the predicate sorted (L), which is true if and only if list L is sorted in ascending order.

b. Write a Prolog definition for the predicate perm (L, M), which is true if and only if L is a permutation of M.

c. Define sort (L, M) (M is a sorted version of L) using perm and sorted.

d. Rim sort- on longer and longer lists until you lose patience. What is the time complexity of your program?

e. Write a faster sorting algorithm, such as insertion sort or quick sort in Prolog.

a. Write Prolog clauses that define the predicate sorted (L), which is true if and only if list L is sorted in ascending order.

b. Write a Prolog definition for the predicate perm (L, M), which is true if and only if L is a permutation of M.

c. Define sort (L, M) (M is a sorted version of L) using perm and sorted.

d. Rim sort- on longer and longer lists until you lose patience. What is the time complexity of your program?

e. Write a faster sorting algorithm, such as insertion sort or quick sort in Prolog.

## Answer to relevant Questions

In this exercise, we will look at the recursive application of rewrite rules, using logic programming. A rewrite rule (or demodulator in OTTER terminology) is an equation with specified direction. For example, the rewrite ...Resolution can produce non-constructive proofs for queries with variables, so we had to introduce special mechanisms to extract definite answers. Explain why this issue does not arise with knowledge bases containing only ...Write definitions for the following:a. Exhaustive Part Decompositionb. Part Partitionc. Part wise DisjointThese should he analogous to the definitions for Exhaustive Decomposition, Partition, and Disjoint. Is it the case ...One part of the shopping process that was not covered in this chapter is checking for compatibility between items. For example, if a customer orders a computer, is it matched with the right peripherals? If a digital camera ...One might suppose that the syntactic distinction between unboxed links and singly boxed links in semantic networks is unnecessary, because singly boxed links are always attached to categories an inheritance algorithm could ...Post your question

0