Bern Martens

发表

Tutorial on Program Specialisation (Abstract)

Danny De Schreye, Michael Leuschel, Bern Martens, 1995, ILPS.

Bottom-up Partial Deduction of Logic Programs

Wim Vanhoof, Danny De Schreye, Bern Martens, 1999, J. Funct. Log. Program..

Integrity Constraint Checking in Deductive Databases Using a Rule/Goal Graph

Maurice Bruynooghe, Bern Martens, 1988, Expert Database Conf..

To parse or not to parse (Extended Abstract)

Wim Vanhoof, Bern Martens, 1997 .

On the semantics of meta-programming and the control of partial deduction in logic programming

Bern Martens, 1994 .

Controlling Conjunctive Partial Deduction

Robert Glück, Bern Martens, Morten Heine Sørensen, 1996, PLILP.

A Framework for Bottom Up Specialisation of Logic Programs

Wim Vanhoof, Danny De Schreye, Bern Martens, 1998, PLILP/ALP.

Project Report on LP+: A Second Generation Logic Programming Language

Bart Demoen, Gerda Janssens, Maurice Bruynooghe, 2000, AI Commun..

Global Control for Partial Deduction through Characteristic Atoms and Global Trees

Michael Leuschel, Bern Martens, M. Leuschel, 1996, Dagstuhl Seminar on Partial Evaluation.

Automatic Finite Unfolding Using Well-Founded Measures

Danny De Schreye, Bern Martens, D. D. Schreye, 1996, J. Log. Program..

Co-de: an online learning platform for computational thinking

Bart Demoen, Bern Martens, Zimcke Van de Staey, 2018, WiPSCE.

Generating Specialised Update Procedures Through Partial Deduction of the Ground Representation

Michael Leuschel, Bern Martens, 1995, Deductive Databases / Abduction in Deductive Databases.

A brief overview of logic programming research at the K.U.Leuven, with notes on its industrialrelevance

Luc De Raedt, Gerda Janssens, Maurice Bruynooghe, 1996 .

Temporal Logics and Temporal Reasoning

Bern Martens, Marc Denecker, Lode Missiaen, 2004 .

Controlling generalization and polyvariance in partial deduction of normal logic programs

Danny De Schreye, Michael Leuschel, Bern Martens, 1998, TOPL.

Why untyped non-ground meta-programming is not (much of) of problem

Danny De Schreye, Bern Martens, D. D. Schreye, 1992 .

Bringing Algorithms to Flemish Classrooms: Teaching the Teachers, and some Students

Bart Demoen, Bern Martens, Kristien Van Loon, 2017, WiPSCE.

A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming

Danny De Schreye, Bern Martens, 1992, JICSLP.

Why Untyped Nonground Metaprogramming Is Not (Much Of) A Problem

Danny De Schreye, Bern Martens, D. D. Schreye, 1995, J. Log. Program..

ICT en algemene vorming in de lessen informatica

Bern Martens, 2002 .

Tutorial on Program Specialisation

Danny De Schreye, Michael Leuschel, Bern Martens, 1995 .

A general criterion for avoiding infinite unfolding during partial deduction

Maurice Bruynooghe, Danny De Schreye, Bern Martens, 2009, New Generation Computing.

Some Further Issues in Finite Unfolding (Abstract)

Danny De Schreye, Bern Martens, 1993, LOPSTR.

Specialising the Other Way Arond

Wim Vanhoof, Danny De Schreye, Bern Martens, 1998, IJCSLP.

Two semantics for definite meta-programs, using the non-ground representation

Danny De Schreye, Bern Martens, 1995 .

Advanced techniques in finite unfolding

Danny De Schreye, Bern Martens, 1993 .

Termination Analysis for Tabled Logic Programming

Danny De Schreye, Michael Leuschel, Bern Martens, 1997, LOPSTR.

Integrity Constraints and Interactive Concept-Learning

Luc De Raedt, Maurice Bruynooghe, Bern Martens, 1991, ML.

Termination analysis for tabled logic programming (extended abstract)

Danny De Schreye, Michael Leuschel, Bern Martens, 1997 .

Positioning computer science in Flemish K-12 education: a reflection

Bern Martens, Tom Hofkens, 2013, WiPSE '13.

Conjunctive Partial Deduction in Practice

Michael Leuschel, Bern Martens, Jesper Jørgensen, 1996, LOPSTR.

Some further issues in finite unfolding

Danny De Schreye, Bern Martens, 1994 .

Starting from scratch: experimenting with computer science in Flemish secondary education

Bern Martens, Francis Wyffels, Stefan Lemmens, 2014, WiPSCE.

Partial Deduction of the Ground Representation and its Application to Integrity Checking

Michael Leuschel, Bern Martens, M. Leuschel, 1995, ILPS.

Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures

Danny De Schreye, Bern Martens, Tamás Horváth, 1992, Theor. Comput. Sci..

Preserving Termination of Tabled Logic Programs While Unfolding

Michael Leuschel, Bern Martens, Konstantinos Sagonas, 1997, LOPSTR.

Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments"

Robert Glück, Danny De Schreye, Michael Leuschel, 2000, J. Log. Program..

Compiling bottom-up and mixed derivations into top-down executable logic programs

Maurice Bruynooghe, Gunther Sablon, Danny De Schreye, 1991, Journal of Automated Reasoning.

IT, Ethics and Education : Teaching the Teachers (and their Pupils)

Bern Martens, B. Martens, 2006, The Information Society.

A sensible least Herbrand semantics for untyped Vanilla meta-programming and its extension to a limited form of amalgamation

Danny De Schreye, Bern Martens, D. D. Schreye, 1992, CNKBS.

To Parse or Not To Parse

Wim Vanhoof, Bern Martens, Bern Martens, 1997, LOPSTR.

Bottom-Up Specialisation of Logic Programs

Wim Vanhoof, Danny De Schreye, Bern Martens, 1998, LOPSTR.

Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance

John P. Gallagher, Bern Martens, Bern Martens, 1995, ICLP.

Some achievements and prospects in partial deduction

Danny De Schreye, Michael Leuschel, Bern Martens, 1998, CSUR.

Industrial applications of computational logic

Gerda Janssens, Maurice Bruynooghe, Bern Martens, 1996 .

Integrity Verification in Knowledge Bases

François Bry, Bern Martens, Rainer Manthey, 1990, RCLP.

Controlling conjunctive partial deduction of definite logic programs

Robert Glück, Bern Martens, Morten Heine Sørensen, 1996 .