{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T16:01:56Z","timestamp":1648656116524},"reference-count":27,"publisher":"Oxford University Press (OUP)","issue":"8","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,12,1]]},"DOI":"10.1093\/logcom\/exx015","type":"journal-article","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T19:11:53Z","timestamp":1492110713000},"page":"2551-2580","source":"Crossref","is-referenced-by-count":1,"title":["On the formal characterization of the FORTE_MBC theory revision operators"],"prefix":"10.1093","volume":"27","author":[{"given":"Ana Lu\u00edsa","family":"Duboc","sequence":"first","affiliation":[{"name":"Pedro II School, Rio de Janeiro, RJ, Brazil. E-mail: alduboc@cp2.g12.br"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aline","family":"Paes","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Institute of Computing, Universidade Federal Fluminense (UFF), Niter\u00f3i, RJ, Brazil. E-mail: alinepaes@ic.uff.br"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerson","family":"Zaverucha","sequence":"additional","affiliation":[{"name":"Department of Systems Engineering and Computer Science - COPPE, Universidade Federal do Rio de Janeiro (UFRJ), Rio de Janeiro, RJ, Brazil. E-mail: gerson@cos.ufrj.br"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2017,5,25]]},"reference":[{"key":"key\n\t\t\t\t20180618200552_B1","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-63577-7_59","article-title":"Learning acyclic first-order horn sentences from entailment. In","volume-title":"Algorithmic Learning Theory","author":"Arimura.","year":"1997"},{"key":"key\n\t\t\t\t20180618200552_B2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-48751-4_4","article-title":"Refinement operators can be (weakly) perfect. In","author":"Badea","year":"1999","journal-title":"Proceedings of the 9th International Worshop on Inductive Logic Programming"},{"key":"key\n\t\t\t\t20180618200552_B3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/956750.956759","article-title":"Adaptive duplicate detection using learnable string similarity measures. In","author":"Bilenko","year":"2003","journal-title":"Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"},{"key":"key\n\t\t\t\t20180618200552_B4","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/3-540-48751-4_6","article-title":"Refining complete hypotheses in ilp. In","volume-title":"Proceedings of the 9th International Conference on Inductive Logic Programming","author":"Bratko.","year":"1999"},{"key":"key\n\t\t\t\t20180618200552_B5","first-page":"1037","article-title":"Multiple predicate learning. In","author":"De Raedt","year":"1993","journal-title":"Proceedings of the 13th International Joint Conference on Artificial Intelligence"},{"key":"key\n\t\t\t\t20180618200552_B6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-68856-3","volume-title":"Logical and Relational Learning","author":"De Raedt.","year":"2008"},{"key":"key\n\t\t\t\t20180618200552_B7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10994-009-5116-8","article-title":"Using the bottom clause and mode declarations in fol theory revision from examples.","volume":"76","author":"Duboc","year":"2009","journal-title":"Machine Learning"},{"key":"key\n\t\t\t\t20180618200552_B8","first-page":"15","article-title":"A generalization model based on oi-implication for ideal theory refinement.","volume":"47","author":"Esposito","year":"2001","journal-title":"Fundamenta Informaticae"},{"key":"key\n\t\t\t\t20180618200552_B9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1023\/A:1007638124237","article-title":"Multistrategy theory revision: induction and abduction in inthelex.","volume":"38","author":"Esposito","year":"2000","journal-title":"Machine Learning"},{"key":"key\n\t\t\t\t20180618200552_B10","first-page":"527","article-title":"Spaces of theories with ideal refinement operators. In","author":"Fanizzi","year":"2003","journal-title":"IJCAI-03, Proceedings of the 18th International Joint Conference on Artificial Intelligence"},{"key":"key\n\t\t\t\t20180618200552_B11","doi-asserted-by":"crossref","first-page":"11322","DOI":"10.1073\/pnas.89.23.11322","article-title":"Drug design by machine learning: the use of inductive logic programming to model the structure-activity relationships of trimethoprim analogues binding to dihydrofolate reductase.","volume":"89","author":"King","year":"1992","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"key\n\t\t\t\t20180618200552_B12","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/BF03037232","article-title":"Relating chemical activity to structure: an examination of ILP successes.","volume":"13","author":"King","year":"1995","journal-title":"New Generation Computing"},{"key":"key\n\t\t\t\t20180618200552_B13","doi-asserted-by":"crossref","first-page":"1317","DOI":"10.1016\/j.artint.2008.02.003","article-title":"Redundancy in logic iii: non-monotonic reasoning.","volume":"172","author":"Liberatore.","journal-title":"Artificial Intelligence"},{"key":"key\n\t\t\t\t20180618200552_B14","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/3-540-48751-4_20","article-title":"A bounded search space of clausal theories. In","author":"Midelfart.","year":"1999","journal-title":"Proceedings of Inductive Logic Programming, 9th International Workshop, ILP-99"},{"key":"key\n\t\t\t\t20180618200552_B15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03037227","article-title":"Inverse entailment and progol.","volume":"13","author":"Muggleton.","year":"1995","journal-title":"New Generation Computing Journal"},{"key":"key\n\t\t\t\t20180618200552_B16","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-642-13840-9_12","article-title":"Chess revision: Acquiring the rules of chess variants through fol theory revision from examples. In","volume-title":"Revised Papers of the 19th International Conference on Inductive Logic Programming","author":"Muggleton","year":"2010"},{"key":"key\n\t\t\t\t20180618200552_B17","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of Inductive Logic Programming","author":"Nienhuys-Cheng","year":"1997"},{"key":"key\n\t\t\t\t20180618200552_B18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10994-016-5595-3","article-title":"On the use of stochastic local search techniques to revise first-order logic theories from examples.","volume":"106","author":"Paes","year":"2017","journal-title":"Machine Learning"},{"key":"key\n\t\t\t\t20180618200552_B19","volume-title":"On the Effective Revision of (Bayesian) Logic Programs from Examples","author":"Paes.","year":"2011"},{"key":"key\n\t\t\t\t20180618200552_B20","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00117105","article-title":"Learning logical definitions from relations.","volume":"5","author":"Quinlan.","year":"1990","journal-title":"Machine Learning"},{"key":"key\n\t\t\t\t20180618200552_B21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01007461","article-title":"Automated refinement of first-order horn-clause domain theories.","volume":"19","author":"Richards","year":"1995","journal-title":"Machine Learning"},{"key":"key\n\t\t\t\t20180618200552_B22","first-page":"63","article-title":"Extensions of inversion of resolution applied to theory completion. In","volume-title":"Inductive logic programming","author":"Rouveirol.","year":"1992"},{"key":"key\n\t\t\t\t20180618200552_B23","first-page":"1","article-title":"The life of a logic programming system. In","volume-title":"Proceedings of the 24th International Conference on Logic Programming (ICLP-08)","author":"Santos Costa.","year":"2008"},{"key":"key\n\t\t\t\t20180618200552_B24","article-title":"The aleph manual.","volume-title":"Technical report","author":"Srinivasan.","year":"2001"},{"key":"key\n\t\t\t\t20180618200552_B25","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s10994-009-5117-7","article-title":"The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause.","volume":"76","author":"Tamaddoni-Nezhad","year":"2009","journal-title":"Machine Learning"},{"key":"key\n\t\t\t\t20180618200552_B26","first-page":"307","article-title":"Existence and nonexistence of complete refinement operators. In","author":"van der Laag","journal-title":"ECML-94: Proceedings of the European Conference on Machine Learning"},{"key":"key\n\t\t\t\t20180618200552_B27","first-page":"14","article-title":"First-order theory refinement. In","volume-title":"Advances in Inductive Logic Programming","author":"Wrobel.","year":"1996"}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/27\/8\/2551\/22301308\/exx015.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T02:03:48Z","timestamp":1569031428000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article\/27\/8\/2551\/3854922"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,25]]},"references-count":27,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2017,5,25]]},"published-print":{"date-parts":[[2017,12,1]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exx015","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2017,12]]},"published":{"date-parts":[[2017,5,25]]}}}