1. http://www.cs.sfu.ca/research/groups/mxp/
2. Mitchell, D., Ternovska, E.: A framework for representing and solving NP search problems. In: Proc. AAAI, pp. 430–435 (2005)
3. Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. Complexity of Computation, 43–74 (1974)
4. Ternovska, E., Mitchell, D.: Declarative programming of search problems with built-in arithmetic. In: Proc. of IJCAI, pp. 942–947 (2009)
5. Tasharrofi, S., Ternovska, E.: Built-in arithmetic in knowledge representation languages. In: NonMon at 30 (Thirty Years of Nonmonotonic Reasoning) (October 2010)