Hello,

Given two logic programs LP1 and LP2, I would like to generate
consequences of LP1 that are not consequences of LP2. Is there an
efficient way of finding these consequences? A basic solution is
quite simple to express:

lp1_and_not_lp2(X) :- lp1(X), \+ lp2(X).

but as the programs become more complex, the inefficiency of this
approach becomes a problem.

It seems to be quite a general problem - is there any theory I should
know about, and is another setting (e.g. CLP / answer set programming)
more suited than Prolog?

In my case, LP1 and LP2 are closely related (to get LP2 just add/
remove a few clauses from LP1) - does this help make the problem
easier to solve?

Thanks for any pointers!
Zoubidoo

A simple example: