Travelled to:1 × Austria
1 × Canada
1 × Italy
1 × Latvia
3 × USA
Collaborated with:A.t.Teije J.v.d.Elst M.Thonnat ∅ A.Bundy A.Smaill W.Beek S.Schlobach P.Groot A.Verberne G.Schreiber C.Horn A.Ireland
Talks about:approxim (4) softwar (2) comput (2) compon (2) model (2) reus (2) use (2) constraint (1) structur (1) function (1)
Person: Frank van Harmelen
DBLP: Harmelen:Frank_van
Contributed to:
2014200420001996
1995
19941994
1990Wrote 9 papers:
- KR-2014-BeekSH #semantics #set #web
- Rough Set Semantics for Identity on the Web (WB, SS, FvH).
- KR-2004-GrootTH #analysis #approximate #case study #classification #problem #towards
- Towards a Structured Analysis of Approximate Problem Solving: A Case Study in Classification (PG, AtT, FvH), pp. 399–406.
- KR-2000-VerberneHT #approximate #constraints #reasoning #using
- Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation (AV, FvH, AtT), pp. 323–332.
- KR-1996-TeijeH #approximate #using
- Computing Approximate Diagnoses By Using Approximate Entailment (AtT, FvH), pp. 256–265.
- SEKE-1995-ElstTH #component #modelling #reuse
- Modelling software components for reuse (JvdE, MT, FvH), pp. 350–357.
- LOPSTR-1994-Harmelen #cost analysis
- A Model of Costs and Benefits of Meta-Level Computation (FvH), pp. 248–261.
- SEKE-1994-ElstHST #component #functional #reuse #specification
- A functional specification of reusing software components (JvdE, FvH, GS, MT), pp. 374–381.
- CADE-1990-BundyHHS
- The Oyster-Clam System (AB, FvH, CH, AS), pp. 647–648.
- CADE-1990-BundyHSI #induction #proving
- Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs (AB, FvH, AS, AI), pp. 132–146.