Publisher
Springer International Publishing
Reference30 articles.
1. Apt, K., Blair, H., & Walker, A. (1988). Towards a theory of declarative knowledge. In J. Minker (Ed.), Foundations of deductive databases and logic programming (pp. 89–148). Morgan Kaufmann.
2. Bidoit, N., & Froidevaux, C. (1987). Minimalism subsumes default logic and circumscription in stratified logic programming. In Proceedings of the Second Annual IEEE Symposium on Logic in Computer Science (pp. 89–97).
3. Brooks, D. R., Erdem, E., Erdoğan, S. T., Minett, J. W., & Ringe, D. (2007). Inferring phylogenetic trees using answer set programming. Journal of Automated Reasoning, 39, 471–511.
4. Clark, K. (1978). Negation as failure. In H. Gallaire & J. Minker (Eds.), Logic and data bases (pp. 293–322). Plenum Press.
5. Dimopoulos, Y., Nebel, B., & Koehler, J. (1997). Encoding planning problems in non-monotonic logic programs. In S. Steel & R. Alami (Eds.), Proceedings of European Conference on Planning (pp. 169–181). Springer.