2004 |
14 | EE | Joost Vennekens,
Sofie Verbaeten,
Maurice Bruynooghe:
Logic Programs with Annotated Disjunctions.
ICLP 2004: 431-445 |
13 | EE | Joost Vennekens,
Sofie Verbaeten,
Maurice Bruynooghe:
Logic programs with annotated disjunctions.
NMR 2004: 409-415 |
12 | EE | Jan Struyf,
Jan Ramon,
Maurice Bruynooghe,
Sofie Verbaeten,
Hendrik Blockeel:
Compact Representation of Knowledge Bases in Inductive Logic Programming.
Machine Learning 57(3): 305-333 (2004) |
2003 |
11 | EE | Sofie Verbaeten,
Anneleen Van Assche:
Ensemble Methods for Noise Elimination in Classification Problems.
Multiple Classifier Systems 2003: 317-325 |
2001 |
10 | EE | Sofie Verbaeten,
Danny De Schreye,
Konstantinos F. Sagonas:
Termination proofs for logic programs with tabling.
ACM Trans. Comput. Log. 2(1): 57-92 (2001) |
9 | EE | Sofie Verbaeten,
Danny De Schreye:
Termination of Simply-Moded Well-Typed Logic Programs under a Tabled Execution Mechanism.
Appl. Algebra Eng. Commun. Comput. 12(1/2): 157-196 (2001) |
2000 |
8 | EE | Sofie Verbaeten,
Danny De Schreye,
Konstantinos F. Sagonas:
Termination Proofs for Logic Programs with Tabling
CoRR cs.LO/0003045: (2000) |
7 | | Sofie Verbaeten,
Marc Denecker,
Danny De Schreye:
Compositionality of Normal Open Logic Programs.
J. Log. Program. 42(3): 151-183 (2000) |
6 | | Sofie Verbaeten,
Annalisa Bossi:
Composing Complete and Partial Knowledge.
Journal of Functional and Logic Programming 2000(6): (2000) |
1999 |
5 | | Sofie Verbaeten,
Danny De Schreye:
Termination Analysis of Tabled Logic Programs Using Mode and Type Information.
Fuji International Symposium on Functional and Logic Programming 1999: 163-178 |
4 | | Sofie Verbaeten:
Termination Analysis for Abductive General Logic Programs.
ICLP 1999: 365-379 |
3 | | Sofie Verbaeten,
Konstantinos F. Sagonas,
Danny De Schreye:
Modular Termination Proofs for Prolog with Tabling.
PPDP 1999: 342-359 |
1998 |
2 | | Sofie Verbaeten:
The Closing Operator: From Partial to Complete Knowledge.
ECAI 1998: 49-50 |
1997 |
1 | | Sofie Verbaeten,
Marc Denecker,
Danny De Schreye:
Compositionality of Normal Open Logic Programs.
ILPS 1997: 371-385 |