摘要
AhomomorphismψoflogicprogramsfromPtoP'isafunctionmappingAtoms(P)toAtoms(P')andpaper,thecomplexityofthedecisionproblemsonhomomorphismandisomorphismfordefinitelogicprogramsisstudied.Itisshownthatthehomomorphismproblem(HOM-LP)fordefinitelogicprogramsisNP-complete,andtheisomorphismproblem(ISO-LP)isequivalenttothegraphisomorphismproblem(GI).
出版日期
2005年06月16日(中国期刊网平台首次上网日期,不代表论文的发表时间)