SAG

Introduction: SAG is a SAT-based answer set solver.

The current system supports normal logic programs which may contain

cardinality constraints and choice rules.

The system is now available (for i386-linux) download .

Usage:

Suppose prog1 and prog2 are the input answer set source programs, run

lparse prog1 prog2 | sag1.1 P

where P is a integer and P>=0. P defines the partial answer set checking probability.

If P=0, no answer set checking is invoked which is applicable only to tight

programs. If P>0, then the probability of invoking partial answer set checking on each

decision level is 1/P.

Optional: “lparse prog1 prog2 | sag1.1 P h” will make SAG run under a different heuristic.

Contact: lin@cs.ttu.edu -- Zhijun Lin

Reference: Zhijun Lin, Yuanlin Zhang, Hector Hernandez: Fast SAT-based Answer Set Solver. AAAI 2006