| 1999 |
|---|
| 9 | | Henrik Boström,
Peter Idestam-Almquist:
Induction of Logic Programs by Example-Guided Unfolding.
J. Log. Program. 40(2-3): 159-183 (1999) |
| 1997 |
|---|
| 8 | | Luc De Raedt,
Peter Idestam-Almquist,
Gunther Sablon:
Theta-Subsumption for Structural Matching.
ECML 1997: 73-84 |
| 7 | | Peter Idestam-Almquist:
Generalization of Clauses Relative to a Theory.
Machine Learning 26(2-3): 213-226 (1997) |
| 1995 |
|---|
| 6 | | Peter Idestam-Almquist:
Generalization of Clauses under Implication.
J. Artif. Intell. Res. (JAIR) 3: 467-489 (1995) |
| 1993 |
|---|
| 5 | | Peter Idestam-Almquist:
Generalization under Implication by using Or-Introduction.
ECML 1993: 56-64 |
| 4 | | Peter Idestam-Almquist:
Generalization under Implication by Recursive Anti-unification.
ICML 1993: 151-158 |
| 3 | | Peter Idestam-Almquist:
Generalization under Implication: Expansions of Clauses for Indirect Roots.
SCAI 1993: 126-136 |
| 1992 |
|---|
| 2 | | Peter Idestam-Almquist:
Learning Missing Clauses by Inverse Resolution.
FGCS 1992: 610-617 |
| 1991 |
|---|
| 1 | | Carl Gustaf Jansson,
Henrik Boström,
Peter Idestam-Almquist:
Optimizing Horn Clause Logic Programs for Particular Modes of Use: An Analysis of Explanation-Based Learning and Partial Evaluation.
SCAI 1991: 252-257 |
