The Closing Operator: From Partial to Complete Knowledge. - Sofie Verbaeten (ECAI, 1998)

Termination Analysis of Tabled Logic Programs Using Mode and Type Information. - Sofie Verbaeten; Danny De Schreye (Fuji International Symposium on Functional and Logic Programming, 1999)

Termination Analysis for Abductive General Logic Programs. - Sofie Verbaeten (ICLP, 1999)

Modular Termination Proofs for Prolog with Tabling. - Sofie Verbaeten; Konstantinos Sagonas; Danny De Schreye (PPDP, 1999)

Composing Complete and Partial Knowledge. - Sofie Verbaeten; Annalisa Bossi (J. Funct. Log. Program., 2000)

Compositionality of Normal Open Logic Programs. - Sofie Verbaeten; Marc Denecker; Danny De Schreye (J. Log. Program., 2000)

Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism. - Sofie Verbaeten; Danny De Schreye (Appl. Algebra Eng. Commun. Comput., 2001)

Termination proofs for logic programs with tabling. - Sofie Verbaeten; Danny De Schreye; Konstantinos Sagonas (ACM Trans. Comput. Log., 2001)

Ensemble Methods for Noise Elimination in Classification Problems. - Sofie Verbaeten; Anneleen Van Assche (Multiple Classifier Systems, 2003)

Logic Programs with Annotated Disjunctions. - Joost Vennekens; Sofie Verbaeten; Maurice Bruynooghe (ICLP, 2004)

Compact Representation of Knowledge Bases in Inductive Logic Programming. - Jan Struyf; Jan Ramon; Maurice Bruynooghe; Sofie Verbaeten; Hendrik Blockeel (Mach. Learn., 2004)