摘要: The problem of automatically generating XML documents that satisfy given user constraints is considered. Specifically, (1) a count-constraint C, expressed using XPath and the aggregate function countand (2) DTD D, an document satisfies both C D studied. Classes count-constraints DTDs for which satisfiability polynomial are identified. For these classes it shown satisfying can be generated efficiently in terms input output.