[Toss-devel] Generalized monotonicity

[Lukasz S. <luk...@gm...>]

Hi,

I'm pressed to implement a refined notion of monotonicity. Distinguish
two subclasses of fluents: positive fluents occur only positively on
RHSes (are only added), and negative fluents only negatively (are only
deleted). An expression E is monotonic in a game G, if positive
fluents (w.r.t. G) occur only negatively in E, negative fluents occur
only positively in E, and remaining (indefinite) fluents don't occur
in E at all. The decision to generate the monotonic heuristic variant
can be made separately for payoff subexpressions, instead of for the
whole game at once.

(connect5 uses a "blank" predicate to mark empty cells -- negative
fluent, it also uses positive fluents for player marks, and indefinite
fluents to select players.)