Fixed-parameter complexity of semantics for logic programs

ACM Transactions on Computational Logic

Volumn 4, Issue 1, 2003, Pages 91-119

  Lonc, Zbigniew ^a   Truszczyński, Miroslaw ^b,c  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF KENTUCKY   (United States)

^c UNIVERSITY OF KENTUCKY   (United States)

Author keywords

Fixed parameter complexity; Normal logic programs; Stable models; Supported models

Indexed keywords

FIXED-PARAMETER COMPLEXITY; NORMAL LOGIC PROGRAMS; STABLE MODELS; SUPPORTED MODELS;

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAM LISTINGS; FORMAL LOGIC; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING;

SEMANTICS;

EID: 2142778440     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/601775.601779     Document Type: Article

References (12)

1. APT, K. 1990. Logic programming. In Handbook of Theoretical Computer Science, J. van Leeuven, Ed. Elsevier, Amsterdam, The Netherlands, 493-574.
2. APT, K. AND VAN EMDEN, M. 1982. Contributions to the theory of logic programming. J. of the ACM 29, 3, 841-862.
3. CLARK, K. 1978. Negation as failure. In Logic and Data Bases, H. Gallaire and J. Minker, Eds. Plenum Press, New York, NY, London, UK, 293-322.
4. DOWLING, W. AND GALLIER, J. 1984. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Logic Programm, 1, 3, 267-284.
5. DOWNEY, R. G. AND FELLOWS, M. R. 1997. Parametrized Complexity. Springer-Verlag, Berlin, Germany.
6. FAGES, F. 1994. Consistency of Clark's completion and existence of stable models. J. Meth. Logic Comput. Sci. 1, 1, 51-60.
7. GELFOND, M. AND LIFSCHITZ, V. 1988. The stable semantics for logic programs. In Proceedings of the 5th International Conference on Logic Programming, R. Kowalski and K. Bowen, Eds. MIT Press, Cambridge, MA, 1070-1080.
8. GOTTLOB, G., SCARCELLO, F., AND SIDERI, M. 1999. Fixed parameter complexity in AI and nonmonotonic reasoning. In Logic Programming and Nonmonotonic Reasoning, Proceedings of the 5th International Conference, LPNMR99, M. Gelfond, N. Leone, and G. Pfeifer, Eds. Lecture Notes in Computer Science, vol. 1730. Springer-Verlag, Berlin, Germany.
9. LLOYD, J. W. 1984. Foundations of Logic Programming. Symbolic Computation. Artificial Intelligence Series. Springer-Verlag, Berlin Germany, New York, NY.
10. MAREK, W. AND TRUSZCZYŃSKI, M. 1991. Autoepistemic logic. J. of the ACM 38, 3, 588-619.
11. MAREK, W. AND TRUSZCZYŃSKI, M. 1993. Nonmonotonic Logics; Context-Dependent Reasoning. Springer-Verlag, Berlin.
12. TRUSZCZYŃSKI, M. 2002. Computing large and small stable models. Theory Practice Logic Programm. 2, 1, 1-23.