非表示:
キーワード:
-
要旨:
We investigate the parallel complexity of computing the stable model of acyclic
general logic programs. Within this class of logic programs, we consider the
cases of negative and definite logic programs. Both cases are proved to be
P-complete. We prove the same for a related problem, namely that of computing
the kernel of a directed acyclic graph.