default search action
Henk Vandecasteele
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [i4]Hendrik Blockeel, Luc Dehaspe, Bart Demoen, Gerda Janssens, Jan Ramon, Henk Vandecasteele:
Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs. CoRR abs/1106.1803 (2011)
2000 – 2009
- 2007
- [j6]Remko Tronçon, Gerda Janssens, Bart Demoen, Henk Vandecasteele:
Fast Frequent Querying with Lazy Control Flow Compilation. Theory Pract. Log. Program. 7(4): 481-498 (2007) - 2006
- [i3]Remko Tronçon, Gerda Janssens, Bart Demoen, Henk Vandecasteele:
Fast Frequent Querying with Lazy Control Flow Compilation. CoRR abs/cs/0601072 (2006) - 2004
- [c6]Remko Tronçon, Gerda Janssens, Henk Vandecasteele:
Fast Query Evaluation with (Lazy) Control Flow Compilation. ICLP 2004: 240-253 - 2003
- [j5]Vítor Santos Costa, Ashwin Srinivasan, Rui Camacho, Hendrik Blockeel, Bart Demoen, Gerda Janssens, Jan Struyf, Henk Vandecasteele, Wim Van Laer:
Query Transformations for Improving the Efficiency of ILP Systems. J. Mach. Learn. Res. 4: 465-491 (2003) - [j4]Henk Vandecasteele, Gerda Janssens:
An Open Ended Tree. Theory Pract. Log. Program. 3(3): 377-385 (2003) - [i2]Henk Vandecasteele, Gerda Janssens:
An Open Ended Tree. CoRR cs.PL/0312027 (2003) - 2002
- [j3]Hendrik Blockeel
, Luc Dehaspe, Bart Demoen, Gerda Janssens, Jan Ramon, Henk Vandecasteele:
Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs. J. Artif. Intell. Res. 16: 135-166 (2002) - 2000
- [c5]Hendrik Blockeel
Executing Query Packs in ILP. ILP 2000: 60-77 - [c4]Hendrik Blockeel, Bart Demoen, Gerda Janssens, Henk Vandecasteele, Wim Van Laer:
Two Advanced Transormations for Improving the Efficiency of an ILP system. ILP Work-in-progress reports 2000 - [i1]Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker:
Detecting Unsolvable Queries for Definite Logic Programs. CoRR cs.LO/0003067 (2000)
1990 – 1999
- 1999
- [j2]Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker:
Detecting Unsolvable Queries for Definite Logic Programs. J. Funct. Log. Program. 1999(Special Issue 2) (1999) - [j1]Stefaan Decorte, Danny De Schreye
Constraint-based termination analysis of logic programs. ACM Trans. Program. Lang. Syst. 21(6): 1137-1195 (1999) - [c3]Henk Vandecasteele, Bart Demoen, Gerda Janssens:
A Finite Domain CLP Solver on Top of Mercury. New Trends in Constraints 1999: 256-273 - 1998
- [c2]Maurice Bruynooghe, Henk Vandecasteele, D. Andre de Waal, Marc Denecker:
Detecting Unsolvable Queries for Definite Logic Programs. PLILP/ALP 1998: 118-133 - 1994
- [c1]Henk Vandecasteele, Danny De Schreye
Implementing a Finite-domain CLP-language on Top of Prolog: a Transformational Approach. LPAR 1994: 84-98
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: