On the formal characterization of the FORTE_MBC theory revision operators-Reference-Cited by-同舟云学术

On the formal characterization of the FORTE_MBC theory revision operators

Published:2017-05-25 Issue:8 Volume:27 Page:2551-2580
ISSN:0955-792X
Container-title:Journal of Logic and Computation
language:en
Short-container-title:

Author:

Duboc Ana Luísa¹,Paes Aline²,Zaverucha Gerson³

Affiliation:

1. Pedro II School, Rio de Janeiro, RJ, Brazil. E-mail: alduboc@cp2.g12.br

2. Department of Computer Science, Institute of Computing, Universidade Federal Fluminense (UFF), Niterói, RJ, Brazil. E-mail: alinepaes@ic.uff.br

3. 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

Publisher

Oxford University Press (OUP)

Subject

Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science

Link

http://academic.oup.com/logcom/article-pdf/27/8/2551/22301308/exx015.pdf

Reference27 articles.

1. Learning acyclic first-order horn sentences from entailment. In;Arimura.,1997

2. Refinement operators can be (weakly) perfect. In;Badea;Proceedings of the 9th International Worshop on Inductive Logic Programming,1999

3. Adaptive duplicate detection using learnable string similarity measures. In;Bilenko;Proceedings of the ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining,2003

4. Refining complete hypotheses in ilp. In;Bratko.,1999

5. Multiple predicate learning. In;De Raedt;Proceedings of the 13th International Joint Conference on Artificial Intelligence,1993

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Online probabilistic theory revision from examples with ProPPR;Machine Learning;2019-05-14