Inductive logic programming : 10th International Conference, ILP 2000 London, UK, July 24 27, 2000 : proceedings
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science. Lecture notes in artificial intelligence
1866 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Inductive logic programming, 10th International Conference, ILP 2000, London, UK, July 24-27, 2000, proceedings, James Cussens, Alan Frisch (eds.), Berlin, Springer, 2000, 1 vol. (X-264 p.), Lecture notes in computer science, 3-540-67795-X • Inductive Logic Programming, Texte imprimé, 9783662170038 |
Inhaltsangabe:
- Invited Paper
- ILP: Just Do It
- Contributed Papers
- A New Algorithm for Learning Range Restricted Horn Expressions
- A Refinement Operator for Description Logics
- Executing Query Packs in ILP
- A Logical Database Mining Query Language
- Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions
- Extending K-Means Clustering to First-Order Representations
- Theory Completion Using Inverse Entailment
- Solving Selection Problems Using Preference Relation Based on Bayesian Learning
- Concurrent Execution of Optimal Hypothesis Search for Inverse Entailment
- Using ILP to Improve Planning in Hierarchical Reinforcement Learning
- Towards Learning in CARIN-ALN
- Inverse Entailment in Nonmonotonic Logic Programs
- A Note on Two Simple Transformations for Improving the Efficiency of an ILP System
- Searching the Subsumption Lattice by a Genetic Algorithm
- New Conditions for the Existence of Least Generalizations under Relative Subsumption.