Arithmetic constraints

Answer Set Programming with Constraints using Lazy Grounding

The paper describes a novel methodology to compute stable models in Answer Set Programming. The proposed approach relies on a bottom-up computation that does not require a preliminary grounding phase. The implementation of the framework can be …