Peter Idestam-Almquist

According to our database, Peter Idestam-Almquist authored at least 10 papers between 1991 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Reducing Workload in Short Answer Grading Using Machine Learning.

Rebecka Weegar, Peter Idestam-Almquist

Int. J. Artif. Intell. Educ., June, 2024

1999

Induction of Logic Programs by Example-Guided Unfolding.

Henrik Boström, Peter Idestam-Almquist

J. Log. Program., 1999

1997

Generalization of Clauses Relative to a Theory.

Peter Idestam-Almquist

Mach. Learn., 1997

Theta-Subsumption for Structural Matching.

Luc De Raedt, Peter Idestam-Almquist, Gunther Sablon

Proceedings of the Machine Learning: ECML-97, 1997

1995

Generalization of Clauses under Implication.

Peter Idestam-Almquist

J. Artif. Intell. Res., 1995

1993

Generalization under Implication: Expansions of Clauses for Indirect Roots.

Peter Idestam-Almquist

Proceedings of the Fourth Scandinavian Conference on Artificial Intelligence, 1993

Generalization under Implication by Recursive Anti-unification.

Peter Idestam-Almquist

Proceedings of the Machine Learning, 1993

Generalization under Implication by using Or-Introduction.

Peter Idestam-Almquist

Proceedings of the Machine Learning: ECML-93, 1993

1992

Learning Missing Clauses by Inverse Resolution.

Peter Idestam-Almquist

Proceedings of the International Conference on Fifth Generation Computer Systems. FGCS 1992, 1992

1991

Optimizing Horn Clause Logic Programs for Particular Modes of Use: An Analysis of Explanation-Based Learning and Partial Evaluation.

Carl Gustaf Jansson, Henrik Boström, Peter Idestam-Almquist

Proceedings of the Third Scandinavian Conference on Artificial Intelligence, 1991