Refinement operators can be (Weakly) perfect

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1634, Issue , 1999, Pages 21-32

  Badea, Liviu ^a   Stanciu, Monica ^a  

^a NATIONAL INSTITUTE FOR RESEARCH AND DEVELOPMENT IN INFORMATICS   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; OPTIMIZATION;

INPUT/OUTPUT; OPTIMALITY; REFINEMENT OPERATORS; SUBTLE INTERACTION; VARIABLE DEPENDENCIES;

INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 84949204017     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48751-4_4     Document Type: Conference Paper

References (6)

1. Esposito F., A. Laterza, D. Malerba, G. Semeraro. Refinement of Datalog Programs. Workshop on Data Mining and ILP, Bari 1996.
2. De Raedt L., M. Bruynooghe. A theory of clausal discovery. IJCAI-93, 1058-1063.
3. Grobelnik M. Induction of Prolog programs with Markus. LOPSTR'93, 57-63.
4. Muggleton S. Inverse entailment and Progol. New Generation Computing Journal, 13:245-286, 1995.
5. van der Laag P. An Analysis of Refinement Operators in ILP. PhD Thesis, Tinbergen Inst. Res. Series 102, 1995.
6. van der Laag P., S.H. Nienhuys-Cheng. Existence and Nonexistence of Complete Refinement Operators. ECML-94, 307-322.