Focusing removes some unnecessary non-determinism from search, but other sources of inefficiency remain. In this lecture we talk about how to resolve existential non-determinism which arises in the ...

In this lecture we extend bottom-up logic programming so it can express state change. We accomplish this by distinguishing persistent facts from those that are ephemeral (also called linear). We use ...

This is a preview. Log in through your library . Abstract In this note we use the concept of intersection cut, introduced by Balas for integer programming problems, to develop a cutting-plane ...