Refinement Operators Can Be (Weakly) Perfect

Liviu Badea, Monica Stanciu. Refinement Operators Can Be (Weakly) Perfect. In Saso Dzeroski, Peter A. Flach, editors, Inductive Logic Programming, 9th International Workshop, ILP-99, Bled, Slovenia, June 24-27, 1999, Proceedings. Volume 1634 of Lecture Notes in Computer Science, pages 21-32, Springer, 1999. [doi]

@inproceedings{BadeaS99,
  title = {Refinement Operators Can Be (Weakly) Perfect},
  author = {Liviu Badea and Monica Stanciu},
  year = {1999},
  url = {http://link.springer.de/link/service/series/0558/bibs/1634/16340021.htm},
  tags = {refinement},
  researchr = {https://researchr.org/publication/BadeaS99},
  cites = {0},
  citedby = {0},
  pages = {21-32},
  booktitle = {Inductive Logic Programming, 9th International Workshop, ILP-99, Bled, Slovenia, June 24-27, 1999, Proceedings},
  editor = {Saso Dzeroski and Peter A. Flach},
  volume = {1634},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66109-3},
}