Limiting the number of times a variable appears in either the head or the body of a rule, we identify two classes of normal propositional logic programs. These classes have the desirable property that stable models, if they exist, can be found in linear time (worst case). We also identify a related class containing programs for which the well-founded model can be acquired in linear time, yet for which computing the stable model(s) remains NP-complete. We show in this class how, by relaxing one constraint, previously linear complexity is increased to intractability.
CITATION STYLE
Seitzer, J., & Schlipf, J. (1997). Affordable classes of normal logic programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1265, pp. 92–111). Springer Verlag. https://doi.org/10.1007/3-540-63255-7_7
Mendeley helps you to discover research relevant for your work.