default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBern Martens
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1994
[b1]Bern Martens:
On the semantics of meta-programming and the control of partial deduction in logic programming. Katholieke Universiteit Leuven, Belgium, 1994
Journal Articles
- 2000
- [j11]Danny De Schreye, Maurice Bruynooghe, Bart Demoen, Marc Denecker, Gerda Janssens, Bern Martens:
Project Report on LP+: A Second Generation Logic Programming Language. AI Commun. 13(1): 13-18 (2000) - [j10]Danny De Schreye
, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen:
Erratum to: "Conjunctive Partial Deduction: Foundations, Control, Algorithms and Experiments". J. Log. Program. 43(3): 265 (2000) - 1999
- [j9]Wim Vanhoof, Danny De Schreye, Bern Martens:
Bottom-up Partial Deduction of Logic Programs. J. Funct. Log. Program. 1999(Special Issue 2) (1999) - [j8]Danny De Schreye, Robert Glück, Jesper Jørgensen, Michael Leuschel, Bern Martens, Morten Heine Sørensen:
Conjunctive Partial Deduction: Foundations, Control, Algorithms, and Experiments. J. Log. Program. 41(2-3): 231-277 (1999) - 1998
- [j7]Michael Leuschel, Bern Martens, Danny De Schreye:
Some Achievements and Prospects in Partial Deduction. ACM Comput. Surv. 30(3es): 4 (1998) - [j6]Michael Leuschel, Bern Martens, Danny De Schreye:
Controlling Generalization amd Polyvariance in Partial Deduction of Normal Logic Programs. ACM Trans. Program. Lang. Syst. 20(1): 208-258 (1998) - 1996
- [j5]Bern Martens, Danny De Schreye:
Automatic Finite Unfolding Using Well-Founded Measures. J. Log. Program. 28(2): 89-146 (1996) - 1995
- [j4]Bern Martens, Danny De Schreye:
Why Untyped Nonground Metaprogramming Is Not (Much Of) A Problem. J. Log. Program. 22(1): 47-99 (1995) - 1994
- [j3]Bern Martens, Danny De Schreye, Tamás Horváth:
Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. Theor. Comput. Sci. 122(1&2): 97-117 (1994) - 1992
- [j2]Maurice Bruynooghe, Danny De Schreye, Bern Martens:
A General Criterion for Avoiding Infinite Unfolding during Partial Deduction. New Gener. Comput. 11(1): 47-79 (1992) - 1991
- [j1]Danny De Schreye, Bern Martens, Gunther Sablon, Maurice Bruynooghe:
Compiling Bottom-up and Mixed Derivations into Top-down Executable Logic Programs. J. Autom. Reason. 7(3): 337-358 (1991)
Conference and Workshop Papers
- 2018
- [c27]Zimcke Van de Staey, Tobias Verlinde, Bart Demoen, Bern Martens:
Co-de: an online learning platform for computational thinking. WiPSCE 2018: 32:1-32:2 - 2017
- [c26]Bern Martens, Bart Demoen, Febe Karpez, Dorien Vandenhove, Kristien Van Loon:
Bringing Algorithms to Flemish Classrooms: Teaching the Teachers, and some Students. WiPSCE 2017: 103-104 - 2014
- [c25]Francis Wyffels, Bern Martens, Stefan Lemmens:
Starting from scratch: experimenting with computer science in Flemish secondary education. WiPSCE 2014: 12-15 - 2013
- [c24]Bern Martens, Tom Hofkens:
Positioning computer science in Flemish K-12 education: a reflection. WiPSCE 2013: 35-36 - 2006
- [c23]Bern Martens:
IT, Ethics and Education : Teaching the Teachers (and their Pupils). The Information Society 2006: 181-193 - 1998
- [c22]Wim Vanhoof, Bern Martens, Danny De Schreye, Karel De Vlaminck:
Specialising the Other Way Arond. IJCSLP 1998: 279-293 - [c21]Wim Vanhoof, Danny De Schreye, Bern Martens:
Bottom-Up Specialisation of Logic Programs. LOPSTR 1998: 325-327 - [c20]Wim Vanhoof, Danny De Schreye, Bern Martens:
A Framework for Bottom Up Specialisation of Logic Programs. PLILP/ALP 1998: 54-72 - 1997
- [c19]Stefaan Decorte, Danny De Schreye, Michael Leuschel, Bern Martens, Konstantinos Sagonas:
Termination Analysis for Tabled Logic Programming. LOPSTR 1997: 111-127 - [c18]Michael Leuschel, Bern Martens, Konstantinos Sagonas:
Preserving Termination of Tabled Logic Programs While Unfolding. LOPSTR 1997: 189-205 - [c17]Wim Vanhoof, Bern Martens:
To Parse or Not To Parse. LOPSTR 1997: 322-342 - 1996
- [c16]Michael Leuschel, Bern Martens:
Global Control for Partial Deduction through Characteristic Atoms and Global Trees. Dagstuhl Seminar on Partial Evaluation 1996: 263-283 - [c15]Jesper Jørgensen, Michael Leuschel, Bern Martens:
Conjunctive Partial Deduction in Practice. LOPSTR 1996: 59-82 - [c14]Robert Glück, Jesper Jørgensen, Bern Martens, Morten Heine Sørensen:
Controlling Conjunctive Partial Deduction. PLILP 1996: 152-166 - 1995
- [c13]Michael Leuschel, Bern Martens:
Generating Specialised Update Procedures Through Partial Deduction of the Ground Representation. Deductive Databases / Abduction in Deductive Databases 1995: 81-95 - [c12]Bern Martens, John P. Gallagher:
Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance. ICLP 1995: 597-611 - [c11]Michael Leuschel, Bern Martens:
Partial Deduction of the Ground Representation and its Application to Integrity Checking. ILPS 1995: 495-509 - [c10]Danny De Schreye, Michael Leuschel, Bern Martens:
Tutorial on Program Specialisation (Abstract). ILPS 1995: 615-616 - 1993
- [c9]Bern Martens, Danny De Schreye:
Some Further Issues in Finite Unfolding (Abstract). LOPSTR 1993: 159-161 - 1992
- [c8]Danny De Schreye, Bern Martens:
A sensible least Herbrand semantics for untyped Vanilla meta-programming and its extension to a limited form of amalgamation. CNKBS 1992: 49-51 - [c7]Bern Martens, Danny De Schreye, Maurice Bruynooghe:
Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. FGCS 1992: 473-480 - [c6]Bern Martens, Danny De Schreye:
A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming. JICSLP 1992: 511-525 - [c5]Danny De Schreye, Bern Martens:
A Sensible Least Herbrand Semantics for Untyped Vanilla Meta-Programming and its Extension to a Limited Form of Amalgamation. META 1992: 192-204 - 1991
- [c4]Luc De Raedt, Maurice Bruynooghe, Bern Martens:
Integrity Constraints and Interactive Concept-Learning. ML 1991: 394-398 - [c3]François Bry, Rainer Manthey, Bern Martens:
Integrity Verification in Knowledge Bases. RCLP 1991: 114-139 - [c2]Maurice Bruynooghe, Danny De Schreye, Bern Martens:
A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs. ISLP 1991: 117-131 - 1988
- [c1]Bern Martens, Maurice Bruynooghe:
Integrity Constraint Checking in Deductive Databases Using a Rule/Goal Graph. Expert Database Conf. 1988: 567-601
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-04-24 22:48 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:
