Computing large and small stable models

Theory and Practice of Logic Programming

Volumn 2, Issue 1, 2002, Pages 1-23

  Truszczyński, Mirosław ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

Fixed parameter complexity; Stable models

Indexed keywords

EID: 18344397731     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068402001138     Document Type: Article

References (22)

1. Apt, K., Blair, H. A. and Walker, A. (1988) Towards a theory of declarative knowledge. In: Minker, J. (ed.), Foundations of Deductive Databases and Logic Programming, pp. 89-142. Washington, DC. Morgan Kaufmann.
2. Aravindan, C., Dix, J. and Niemelä, I. (1997) DisLoP: Towards a disjunctive logic programming system. Logic Programming and Nonmonotonic Reasoning, pp. 342-353. Dagstuhl, Germany. Lecture Notes in Computer Science 1265. Springer-Verlag.
3. Aravindan, C., Dix, J. and Niemelä, I. (1997) DisLoP: Towards a disjunctive logic programming system. Logic Programming and Nonmonotonic Reasoning, pp. 342-353. Dagstuhl, Germany. Lecture Notes in Computer Science 1265. Springer-Verlag.
4. Ben-Eliyahu, R. and Dechter, R. (1994) Propositional semantics for disjunctive logic programs. Ann. Math. & Artif. Intell. 12, 53-87.
5. Bidoit, N. and Froidevaux, C. (1991) Negation by default and unstratifiable logic programs. Theor. Comput. Sci. 78(1), (Part B), 85-112.
6. Bondarenko, A., Toni, F. and Kowalski, R. A. (1993) An assumption-based framework for non-monotonic reasoning. In: Nerode, A. and Pereira, L. (eds.), Logic Programming and Non-Monotonic Reasoning, pp. 171-189. Lisbon, Portugal. MIT Press.
7. Brass, S. and Dix, J. (1997) Characterizations of the disjunctive stable semantics by partial evaluation. J. Logic Programming, 32(3), 207-228.
8. Cholewiński, P., Marek, W. and Truszczyński, M. (1996) Default reasoning system DeReS. Proceedings of KR-96, pp. 518-528. Morgan Kaufmann.
9. Downey, R. G. and Fellows, M. R. (1997) Parametrized Complexity. Springer-Verlag.
10. Eiter, T., Leone, N., Mateis, C., Pfeifer, G. and Scarcello, F. (1997) A deductive system for non-monotonic reasoning. Logic Programming and Nonmonotonic Reasoning, pp. 364-375. Dagstuhl, Germany. Lecture Notes in Computer Science 1265. Springer-Verlag.
11. Eiter, T., Leone, N., Mateis, C., Pfeifer, G. and Scarcello, F. (1997) A deductive system for non-monotonic reasoning. Logic Programming and Nonmonotonic Reasoning, pp. 364-375. Dagstuhl, Germany. Lecture Notes in Computer Science 1265. Springer-Verlag.
12. Gelfond, M. and Lifschitz, V. (1988) The stable semantics for logic programs. In: Kowalski, R. and Bowen, K. (eds.), Proceedings 5th International Symposium on Logic Programming, pp. 1070-1080. MIT Press.
13. Gottlob, G., Scarcello, F. and Sideri, M. (1999) Fixed parameter complexity in AI and nonmonotonic reasoning. In: Gelfond, M., Leone, N. and Pfeifer, G. (eds.), Logic Programming and Nonmonotonic Reasoning, Proceedings of the 5th International Conference, LPNMR99: Lecture Notes in Computer Science 1730. Springer-Verlag.
14. Lonc, Z. and Truszczyński, M. (2000) Fixed-parameter complexity of problems in logic programming. In preparation.
15. Marek, V. W. and Truszczyński, M. (1999) Stable models and an alternative logic programming paradigm. In: Apt, K. R., Marek, W., Truszczyński, M. and Warren, D. S. (eds.), The Logic Programming Paradigm: a 25-year Perspective, pp. 375-398. Springer-Verlag.
16. Marek, W. and Truszczyński, M. (1989) Stable semantics for logic programs and default theories. In: Lusk, E. and Overbeek, R. (eds.), Proceedings of the North American Conference on Logic Programming, pp. 243-256. MIT Press.
17. Marek, W. and Truszczyński, M. (1991) Autoepistemic logic. J. ACM, 38(3), 588-619.
18. Marek, W. and Truszczyński, M. (1993) Nonmonotonic Logics; Context-Dependent Reasoning. Springer-Verlag.
19. Niemelä, I. (1999) Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. & Artif. Intell., 25(3-4), 241-273.
20. Niemelä, I. and Simons, P. (1996) Efficient implementation of the well-founded and stable model semantics. Proc. JICSLP-96. MIT Press.
21. van Emden, M. H. and Kowalski, R. A. (1976) The semantics of predicate logic as a programming language. J. ACM, 23(4), 733-742.
22. Van Gelder, A., Ross, K. A. and Schlipf, J. S. (1991) The well-founded semantics for general logic programs. J. ACM, 38(3), 620-650.