摘要
SeveralextensionsofthelogicprogramminglanguagePrologtononHornclausesusecaseanalysistohandlenon-Hornclauses.Inthispaper,analyticalandempriricalevidencesarepresentedtoshowthat,bymakingasetofclausesless'non-Horn'usingpredicatedrenaming.theperformanceofthesecase-analysisbasedprocedurescanbeimprovedsignificantly.Inaddition,thepaperalsoinvestigatedtheproblemofefficeientlyconstructingapredicaterenamingthatreducesthedegreeof'non-Hornness'ofaclausesetmaximally.Itisshownthatthisproblemoffindingaredicaterenamingtoachieveminimal'non-Hornness'isNP-complete.
出版日期
2000年05月15日(中国期刊网平台首次上网日期,不代表论文的发表时间)