References

1. Joaquin Arias, Manuel Carro, Elmer Salazar, Kyle Marple & Gopal Gupta (2018): Constraint answer set programming without grounding. TPLP 18(3-4), pp. 337–354, doi:10.1017/S1471068418000285.
2. Thomas Eiter (2005): Data integration and answer set programming. In: LPNMR. Springer, pp. 13–25, doi:10.1007/11546207_2.
3. Thomas Eiter, Georg Gottlob & Heikki Mannila (1997): Disjunctive datalog. ACM TODS 22(3), pp. 364–418, doi:10.1145/261124.261126.
4. Martin Gebser, Nicola Leone, Marco Maratea, Simona Perri, Francesco Ricca & Torsten Schaub (2018): Evaluation Techniques and Systems for Answer Set Programming: a Survey. In: IJCAI. ijcai.org, pp. 5450–5456, doi:10.24963/ijcai.2018/769.
5. M. Gelfond & Y. Kahl (2014): Knowledge representation, reasoning, and the design of intelligent agents: The answer-set programming approach. Cambridge Univ. Press, doi:10.1017/cbo9781139342124.007.
6. Charles Antony Richard Hoare (1969): An axiomatic basis for computer programming. Communications of the ACM 12(10), pp. 576–580, doi:10.1145/363235.363259.
7. John W Lloyd (1987): Foundations of logic programming. Springer, doi:10.1016/0933-3657(89)90008-0.
8. Z. Manna & R. J. Waldinger (1971): Towards automatic program synthesis. In: Symp. on Semantics of Algo. Lang.. Springer, pp. 270–310, doi:10.1007/BFb0059702.
9. K. Marple, E. Salazar & G. Gupta (2017): Computing stable models of normal logic programs without grounding. arXiv:1709.00501.
10. Kyle Marple, Ajay Bansal, Richard Min & Gopal Gupta (2012): Goal-directed execution of answer set programs. In: Proc. 14th PPDP Symposium. ACM, pp. 35–44, doi:10.1145/2370776.2370782.
11. Kyle Marple & Gopal Gupta (2014): Dynamic consistency checking in goal-directed answer set programming. TPLP 14(4-5), pp. 415–427, doi:10.1017/S1471068414000118.
12. Luke Simon, Ajay Mallya, Ajay Bansal & Gopal Gupta (2006): Coinductive logic programming. In: International Conference on Logic Programming. Springer, pp. 330–345, doi:10.1007/11799573_2.
13. Armando Solar-Lezama, Liviu Tancau, Rastislav Bodik, Sanjit Seshia & Vijay Saraswat (2006): Combinatorial sketching for finite programs. ACM Sigplan Notices 41(11), pp. 404–415, doi:10.1145/1168918.1168907.
14. S. Srivastava, S. Gulwani & J. S. Foster (2010): From program verification to program synthesis. In: ACM Sigplan Notices 45(1):313-326, doi:10.1145/1707801.1706337.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org