Get started
Author

Bern Martens

Observed names: Martens, Bern, Martens, Bernd
Institution: KU Leuven
OpenAlex ID: A5113466437
Conjunctive partial deduction: foundations, control, algorithms, and experiments
1999 · Danny De Schreye, Robert Glück, et al. · The Journal of Logic Programming · 96
Controlling generalization and polyvariance in partial deduction of normal logic programs
1998 · Michael Leuschel, Bern Martens, et al. · ACM Transactions on Programming Languages and Systems · 86
PDF
Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance
1995 · Bern Martens, John Gallagher · The MIT Press eBooks · 68
PDF
A general criterion for avoiding infinite unfolding during partial deduction
1992 · Maurice Bruynooghe, Danny De Schreye, et al. · New Generation Computing · 68
Global control for partial deduction through characteristic atoms and global trees
1996 · Michael Leuschel, Bern Martens · Lecture notes in computer science · 52
Automatic finite unfolding using well-founded measures
1996 · Bern Martens, Danny De Schreye · The Journal of Logic Programming · 37
PDF
Conjunctive partial deduction in practice
1997 · Jesper Jørgensen, Michael Leuschel, et al. · Lecture notes in computer science · 31
Controlling conjunctive partial deduction of definite logic programs
1996 · Robert Glück, J. Jørgensen, et al. · 31
Sound and complete partial deduction with unfolding based on well-founded measures
1994 · Bern Martens, Danny De Schreye, et al. · Theoretical Computer Science · 31
PDF
Integrity verification in knowledge bases
1992 · François Bry, Rainer Manthey, et al. · Lecture notes in computer science · 31
Controlling conjunctive partial deduction
1996 · Robert Glück, Jesper Jørgensen, et al. · Lecture notes in computer science · 27
Why untyped nonground metaprogramming is not (much of) a problem
1995 · Bern Martens, Danny de Schreye · The Journal of Logic Programming · 24
PDF
Termination Analysis for Tabled Logic Programming
1998 · Stefaan Decorte, Danny De Schreye, et al. · Lecture notes in computer science · 21
A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs.
1991 · Maurice Bruynooghe, Danny De Schreye, et al. · Lirias (KU Leuven) · 17
To Parse or Not To Parse
1998 · Wim Vanhoof, Bern Martens · Lecture notes in computer science · 14
Two semantics for definite meta-programs, using the non-ground representation
1995 · Bern Martens, Danny De Schreye · The MIT Press eBooks · 13
Preserving termination of tabled logic programs while unfolding
1997 · Michaël Leuschel, Bern Martens, et al. · Lirias · 12
A sensible least Herbrand semantics for untyped vanilla meta-programming and its extension to a limited form of amalgamation
1992 · Danny Schreye, Bern Martens · Lecture notes in computer science · 11
Integrity constraint checking in deductive databases using a rule/goal graph
1988 · Bern Martens, Maurice Bruynooghe · Lirias · 9
Starting from scratch
2014 · Francis wyffels, Bern Martens, et al. · Workshop in Primary and Secondary Computing Education · 8
PDF
Compiling bottom-up and mixed derivations into top-down executable logic programs
1991 · Danny De Schreye, Bern Martens, et al. · Journal of Automated Reasoning · 8
PDF
Integrity Verification in Knowledge Bases
1991 · Bry, François, Manthey, Rainer, et al. · 7
Preserving Termination of Tabled Logic Programs While Unfolding (Extended Abstract)
1998 · Michael Leuschel, Bern Martens, et al. · Lecture notes in computer science · 6
Tutorial on Program Specialisation (Abstract).
1995 · Danny De Schreye, Michaël Leuschel, et al. · 6
Positioning computer science in Flemish K-12 education
2013 · Bern Martens, Tom Hofkens · Workshop in Primary and Secondary Computing Education · 5
PDF
Works count: 61
Citation count: 766
H-index: 14
I10-index: 18
Year
Topic
Type