On the Complexity of Perfect Models of Logic Programs

Sergey Dudakov. On the Complexity of Perfect Models of Logic Programs. Fundamenta Informaticae, 39(3):249-258, 1999.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.