Shan-Hwei Nienhuys-Cheng

Proceedings of the Inductive Logic Programming, 10th International Conference, 2000

Refining Concepts in Description Logics.

[BibT_eX]

[DOI]

Liviu Badea

Proceedings of the 2000 International Workshop on Description Logics (DL2000), 2000

1999

Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms.

[BibT_eX]

[DOI]

Wim Van Laer

Jan Ramon

Luc De Raedt

Proceedings of the Inductive Logic Programming, 9th International Workshop, 1999

1998

Linear Dynamic Kahn Networks are Deterministic.

[BibT_eX]

[DOI]

Arie de Bruin

Theor. Comput. Sci., 1998

Completeness and Properness of Refinement Operators in Inductive Logic Programming.

[BibT_eX]

[DOI]

J. Log. Program., 1998

Distances and Limits on Herbrand Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Inductive Logic Programming, 8th International Workshop, 1998

1997

Kahn's Fixed-Point Characterization for Linear Dynamic Networks.

[BibT_eX]

[DOI]

Arie de Bruin

Proceedings of the SOFSEM '97: Theory and Practice of Informatics, 1997

Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept.

[BibT_eX]

[DOI]

Proceedings of the Inductive Logic Programming, 7th International Workshop, 1997

Foundations of Inductive Logic Programming

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 1228, Springer, ISBN: 3-540-62927-0, 1997

1996

Least Generalizations and Greatest Specializations of Sets of Clauses.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 1996

Least Generalizations under Implication.

[BibT_eX]

[DOI]

Proceedings of the Inductive Logic Programming, 6th International Workshop, 1996

A Complete Method for Program Specialization Based on Unfolding.

[BibT_eX]

Proceedings of the 12th European Conference on Artificial Intelligence, 1996

1995

The Equivalence of the Subsumption Theorem and the Refutation-Completeness for Unconstrained Resolution.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 1995

1994

Sample PAC-Learnability in Model Inference.

[BibT_eX]

[DOI]

Mark Polman

Proceedings of the Machine Learning: ECML-94, 1994

Existence and Nonexistence of Complete Refinement Operators.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning: ECML-94, 1994

1993

Complexity Dimensions and Learnability.

[BibT_eX]

[DOI]

Mark Polman

Proceedings of the Machine Learning: ECML-93, 1993

Subsumption and Refinement in Model Inference.

[BibT_eX]

[DOI]

Proceedings of the Machine Learning: ECML-93, 1993

Constructing Refinement Operators by Decomposing Logical Implication.

[BibT_eX]

[DOI]

Leendert W. N. van der Torre

Proceedings of the Advances in Artificial Intelligence, 1993

1991

Consistent Term Mappings, Term Partitions and Inverse Resolution.

[BibT_eX]

[DOI]

Peter A. Flach

Proceedings of the Machine Learning, 1991

1990

Classification and syntax of constraints in binary semantical networks.

[BibT_eX]

[DOI]