(aside image)

ASP(DL)

This is an extension of answer set programming (ASP) where rules and difference constraints are used together for modelling.

Prototype Implementation

Simple Example

Related Publications

T. Janhunen, G. Liu, and I. Niemelš: Tight Integration of Non-Ground Answer Set Programming and Satisfiability Modulo Theories. In P. Cabalar, D. Mitchell, D. Pearce, and E. Ternovska, editors, the Proceedings of the 1st Workshop on Grounding and Transformations for Theories with Variables (GTTV'11), 1—13. Vancouver, British Columbia, Canada, May 2011.