A conjunctive query problem is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tuple, a conjunctive query and a database in relational database theory are regarded as a ground atom, a nonrecursive function-free definite clause and a finite set of ground atoms, respectively, in inductive logic programming terminology. An acyclic...