"Avoiding Non-Termination when Learning Logical Programs: A Case Study with ..."

Giovanni Semeraro et al. (1994)

> Home

Details and statistics

DOI: 10.1007/3-540-58792-6_12

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lopstr/SemeraroEMBP94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lopstr/SemeraroEMBP94
Giovanni Semeraro, Floriana Esposito, Donato Malerba, Clifford Brunk, Michael J. Pazzani:
Avoiding Non-Termination when Learning Logical Programs: A Case Study with FOIL and FOCL. LOPSTR 1994: 183-198

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.