Extending and implementing the stable model semantics
Artificial Intelligence
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
A First Order Forward Chaining Approach for Answer Set Computing
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
GrinGo: a new grounder for answer set programming
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
A First Order Forward Chaining Approach for Answer Set Computing
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Dialectical Proofs for Constrained Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Argumentation and answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
The third answer set programming competition: preliminary report of the system competition track
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Finitely recursive programs: Decidability and bottom-up computation
AI Communications
OMiGA: an open minded grounding on-the-fly answer set solver
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
We present the first version of our ASP solver ASPeRiX that implements a new approach of answer set computation. The main specifity of our system is to realize a forward chaining of first order rules that are grounded on the fly. So, unlike all others available ASP systems ASPeRiX does not need a pregrounding processing.