The correct answer set for the example "gss.hex" is only returned if the program is not decomposed for the UFS check. It seems that some wrong nogoods are added in line 493 of UnfoundedSetChecker.cpp that result in the deletion of the only answer set with option --flpcheck=aufs set. The example is a saturation encoding of the NP^NP problem "Generalized Subset Sum" from:
Alviano, Mario, Wolfgang Faber, and Martin Gebser. "Rewriting recursive aggregates in answer set programming: back to monotonicity." Theory and Practice of Logic Programming 15.4-5 (2015): 559-573.
tobiaskaminski
commented
9 years ago
The correct answer set for the example "gss.hex" is only returned if the program is not decomposed for the UFS check. It seems that some wrong nogoods are added in line 493 of UnfoundedSetChecker.cpp that result in the deletion of the only answer set with option --flpcheck=aufs set. The example is a saturation encoding of the NP^NP problem "Generalized Subset Sum" from: Alviano, Mario, Wolfgang Faber, and Martin Gebser. "Rewriting recursive aggregates in answer set programming: back to monotonicity." Theory and Practice of Logic Programming 15.4-5 (2015): 559-573.