Patrick R. J. van der Laag

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◁ ▷ joint publications with coauthor community group 1

> Home > Persons > Patrick R. J. van der Laag

Publications

1998
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jlp/LaagN98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jlp/LaagN98
Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng:
Completeness and Properness of Refinement Operators in Inductive Logic Programming. J. Log. Program. 34(3): 201-225 (1998)
1994
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/ecml/LaagN94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ecml/LaagN94
Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng:
Existence and Nonexistence of Complete Refinement Operators. ECML 1994: 307-322
1993
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/aiia/Nienhuys-ChengLT93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aiia/Nienhuys-ChengLT93
Shan-Hwei Nienhuys-Cheng, Patrick R. J. van der Laag, Leendert W. N. van der Torre:
Constructing Refinement Operators by Decomposing Logical Implication. AI*IA 1993: 178-189
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/ecml/LaagN93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ecml/LaagN93
Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng:
Subsumption and Refinement in Model Inference. ECML 1993: 95-114

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.