![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
7. ILP 1997: Prague, Czech Republic
- Nada Lavrac, Saso Dzeroski
:
Inductive Logic Programming, 7th International Workshop, ILP-97, Prague, Czech Republic, September 17-20, 1997, Proceedings. Lecture Notes in Computer Science 1297, Springer 1997, ISBN 3-540-63514-9
Invited Papers
- Usama M. Fayyad:
Knowledge Discovery in Databases: An Overview. 3-16 - Georg Gottlob
, Nicola Leone
, Francesco Scarcello
:
On the Complexity of Some Inductive Logic Programming Problems. 17-32 - Jean-Francois Puget:
Inductive Logic Programming and Constraint Logic Programming (Abstract). 33
Papers
- Zoltán Alexin, János Csirik, Tibor Gyimóthy
, Márk Jelasity
, László Tóth
:
Learning Phonetic Rules in a Speech Recognition System. 37-44 - Simon Anthony, Alan M. Frisch
:
Cautious Induction in Inductive Logic Programming. 45-60 - Simon Anthony, Alan M. Frisch
:
Generating Numerical Literals During Refinement. 61-76 - Hendrik Blockeel
, Luc De Raedt
:
Lookahead and Discretization in ILP. 77-84 - Christopher H. Bryant
:
Data Mining via ILP: The Application of Progol to a Database of Enantioseparations. 85-92 - James Cussens:
Part-of-Speech Tagging Using Progol. 93-108 - Luc Dehaspe:
Maximum Entropy Modeling with Clausal Constraints. 109-124 - Luc Dehaspe, Luc De Raedt
:
Mining Association Rules in Multiple Relations. 125-132 - Luc De Raedt
, Hendrik Blockeel
:
Using Logical Decision Trees for Clustering. 133-140 - Saso Dzeroski
, Tomaz Erjavec
:
Induction of Slovene Nominal Paradigms. 141-148 - Peter A. Flach
:
Normal Forms for Inductive Logic Programming. 149-156 - Koichi Furukawa, Tomoko Murakami, Ken Ueno, Tomonobu Ozaki, Keiko Shimazu:
On a Sufficient Condition for the Existence of Most Specific Hypothesis in Progol. 157-164 - Mitsue Furusawa, Nobuhiro Inuzuka, Hirohisa Seki, Hidenori Itoh:
Induction of Logic Programs with More Than One Recursive Clause by Analyzing Saturations. 165-172 - Peter Geibel, Fritz Wysotzki:
A Logical Framework for Graph Theoretical Decision Tree Learning. 173-180 - Antonis C. Kakas
, Fabrizio Riguzzi
:
Learning with Abduction. 181-188 - Lionel Martin, Christel Vrain:
Systematic Predicate Invention in Inductive Logic Programming. 189-204 - Stephen Moyle, Stephen H. Muggleton:
Learning Programs in the Event Calculus. 205-212 - Shan-Hwei Nienhuys-Cheng:
Distance Between Herbrand Interpretations: A Measure for Approximations to a Target Concept. 213-226 - Tomonobu Ozaki, Koichi Furukawa, Tomoko Murakami, Ken Ueno:
Realizing Progol by Forward Reasoning. 227-234 - Uros Pompe, Igor Kononenko:
Probabilistic First-Order Classification. 235-242 - Chandra Reddy, Prasad Tadepalli:
Learning Horn Definitions with Equivalence and Membership Queries. 243-255 - Ken Sadohara, Makoto Haraguchi:
Using Abstraction Schemata in Inductive Logic Programming. 256-263 - Michèle Sebag:
Distance Induction in First Order Logic. 264-272 - Ashwin Srinivasan, Ross D. King
, Stephen H. Muggleton, Michael J. E. Sternberg
:
Carcinogenesis Predictions Using ILP. 273-287 - Irene Weber
:
Discovery of First-Order Regularities in a Relational Database Using Offline Candidate Determination. 288-295 - Akihiro Yamamoto:
Which Hypotheses Can Be Found with Inverse Entailment? 296-308
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.