In the course of constructing a deductive database for simple algebraic groups
we have come up with the following wish list,

Builtin polynomial operations,

Random access of an item from a list

Returning *upto* N solutions

I would very much appreciate if someone can tell me whether any of the above
features are available in any existing Prolog systems.

Thanks in advance
Sridhar