SPARC - Sorted ASP with Consistency Restoring Rules
This work addresses usability and efficiency issues in knowledge representation for educators and developers, but it is incremental as it builds on existing CR-Prolog and DLV frameworks.
The authors tackled the challenge of making CR-Prolog more suitable for teaching and large applications by developing SPARC, a sorted version, and translating it to DLV, comparing performance with state-of-the-art solvers.
This is a preliminary report on the work aimed at making CR-Prolog -- a version of ASP with consistency restoring rules -- more suitable for use in teaching and large applications. First we describe a sorted version of CR-Prolog called SPARC. Second, we translate a basic version of the CR-Prolog into the language of DLV and compare the performance with the state of the art CR-Prolog solver. The results form the foundation for future more efficient and user friendly implementation of SPARC and shed some light on the relationship between two useful knowledge representation constructs: consistency restoring rules and weak constraints of DLV.