ASPeRiX

Association:

LERIA, University of Angers, France

Description:

ASPeRiX implements in C++ a new approach of answer set computation based on the forward chaining of first order rules that are grounded on the fly. Thus, unlike others available ASP systems, ASPeRiX does not need a pregrounding processing.

Participants:

• Pascal Nicolas, LERIA, University of Angers, France
• Claire Lefèvre, LERIA, University of Angers, France

System settings:

For the competition we use the same prototype system ASPeRiX 0.2 for all benchmarks with the same parameters (-N 2147483648 and -F 1000000) to limit the range of integers and the nesting level of functionnal terms. For the moment, ASPeRiX 0.2 accepts arithmetic calculus and symbolic functions provided that rules are safe, but not cardinality constraints, agregates, … That is why we do not deal with all benchmarks of the competition. All programs that we have developped (originaly or from previously available encodings) to encode the benchmarks are available in the public archive /home/asp07/ASPeRiX/benchAsperix.tgz