Travelled to:
1 × Germany
1 × Italy
1 × Japan
1 × Sweden
2 × Belgium
2 × United Kingdom
4 × USA
Collaborated with:
D.D.Schreye M.Leuschel W.Vanhoof M.Bruynooghe J.Jørgensen K.F.Sagonas J.P.Gallagher L.D.Raedt K.D.Vlaminck R.Glück M.H.Sørensen S.Decorte
Talks about:
program (7) partial (5) deduct (5) logic (5) specialis (4) unfold (3) termin (3) conjunct (2) integr (2) bottom (2)
Person: Bern Martens
DBLP: Martens:Bern
Contributed to:
Wrote 15 papers:
- ALP-PLILP-1998-VanhoofSM #bottom-up #framework #logic programming #source code
- A Framework for Bottom Up Specialisation of Logic Programs (WV, DDS, BM), pp. 54–72.
- JICSLP-1998-VanhoofMSV
- Specialising the Other Way Arond (WV, BM, DDS, KDV), pp. 279–293.
- LOPSTR-1998-VanhoofSM #bottom-up #logic programming #source code
- Bottom-Up Specialisation of Logic Programs (WV, DDS, BM), pp. 325–327.
- LOPSTR-1997-DecorteSLMS #analysis #logic programming #termination
- Termination Analysis for Tabled Logic Programming (SD, DDS, ML, BM, KFS), pp. 111–127.
- LOPSTR-1997-LeuschelMS #logic programming #source code #termination
- Preserving Termination of Tabled Logic Programs While Unfolding (ML, BM, KFS), pp. 189–205.
- LOPSTR-1997-VanhoofM
- To Parse or Not To Parse (WV, BM), pp. 322–342.
- LOPSTR-1996-JorgensenLM #deduction
- Conjunctive Partial Deduction in Practice (JJ, ML, BM), pp. 59–82.
- PLILP-1996-GluckJMS #deduction
- Controlling Conjunctive Partial Deduction (RG, JJ, BM, MHS), pp. 152–166.
- ICLP-1995-MartensG #deduction #flexibility #termination
- Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance (BM, JPG), pp. 597–611.
- ILPS-1995-LeuschelM #deduction #representation
- Partial Deduction of the Ground Representation and its Application to Integrity Checking (ML, BM), pp. 495–509.
- ILPS-1995-SchreyeLM #tutorial
- Tutorial on Program Specialisation (DDS, ML, BM), pp. 615–616.
- LOPSTR-1993-MartensS #finite
- Some Further Issues in Finite Unfolding (BM, DDS), pp. 159–161.
- JICSLP-1992-MartensS #metaprogramming #semantics
- A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming (BM, DDS), pp. 511–525.
- ISLP-1991-BruynoogheSM #deduction #infinity #logic programming #source code
- A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs (MB, DDS, BM), pp. 117–131.
- ML-1991-RaedtBM #concept #constraints #interactive
- Integrity Constraints and Interactive Concept-Learning (LDR, MB, BM), pp. 394–398.