-
Notifications
You must be signed in to change notification settings - Fork 16
Open
Description
Hi, I'm working on a task when setting negative cost as "reward" can be useful, which doesn't seem to work
can't convert negative int to unsigned
To illustrate why I want negative, considering a conjunction among FOL formulas (AND phi_1 phi_2 ...), and the task is to rewrite it to (AND phi_1' phi_2' ... phi_n') with most n (without different phi being the same). So the way I (want to) implement is to use head-tail for AND with negative cost, then whenever phi_i === (and p1 p2), we can split it into top-level phi_i1, phi_i2 with the preference.
Since I didn't find document on it, what's the restriction on cost? and any suggestion on how to achieve the "reward"? Thanks
Metadata
Metadata
Assignees
Labels
No labels