{"title":"Efficient Theta-Subsumption Based on Graph Algorithms","authors":"T. Scheffer, R. Herbrich, F. Wysotzki","doi":"10.1007/3-540-63494-0_57","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":176774,"journal":{"name":"Inductive Logic Programming Workshop","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1996-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Inductive Logic Programming Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-63494-0_57","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
