default search action

combined dblp search
author search
venue search
publication search

ask others

29th ILP 2019: Plovdiv, Bulgaria

> Home > Conferences and Workshops > ILP

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

- view
  authority control:
- export record
  dblp key:
  - conf/ilp/2019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/2019
Dimitar Kazakov, Can Erten:
Inductive Logic Programming - 29th International Conference, ILP 2019, Plovdiv, Bulgaria, September 3-5, 2019, Proceedings. Lecture Notes in Computer Science 11770, Springer 2020, ISBN 978-3-030-49209-0
- view
  authority control:
- export record
  dblp key:
  - conf/ilp/AlgahtaniK19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/AlgahtaniK19
Eyad Algahtani, Dimitar Kazakov:
CONNER: A Concurrent ILP Learner in Description Logic. 1-15
- view
  authority control:
- export record
  dblp key:
  - conf/ilp/BarthaC19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/BarthaC19
Sándor Bartha, James Cheney:
Towards Meta-interpretive Learning of Programming Language Semantics. 16-25
- view
  authority control:
- export record
  dblp key:
  - conf/ilp/DyoubCL19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/DyoubCL19
Abeer Dyoub, Stefania Costantini, Francesca A. Lisi:
Towards an ILP Application in Machine Ethics. 26-35
- view
  authority control:
- export record
  dblp key:
  - conf/ilp/GianniniMDMG19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/GianniniMDMG19
Francesco Giannini, Giuseppe Marra, Michelangelo Diligenti, Marco Maggini, Marco Gori:
On the Relation Between Loss Functions and T-Norms. 36-45
- view
  authority control:
- export record
  dblp key:
  - conf/ilp/HuaH19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/HuaH19
Yingbing Hua, Björn Hein:
Rapid Restart Hill Climbing for Learning Description Logic Concepts. 46-61
- view
  authority control:
- export record
  dblp key:
  - conf/ilp/KaurKJKN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/KaurKJKN19
Navdeep Kaur, Gautam Kunapuli, Saket Joshi, Kristian Kersting, Sriraam Natarajan:
Neural Networks for Relational Data. 62-71
- view
  authority control:
- export record
  dblp key:
  - conf/ilp/PhuaI19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/PhuaI19
Yin Jun Phua, Katsumi Inoue:
Learning Logic Programs from Noisy State Transition Data. 72-80
- view
  authority control:
- export record
  dblp key:
  - conf/ilp/0002S19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/0002S19
Hien D. Nguyen, Chiaki Sakama:
A New Algorithm for Computing Least Generalization of a Set of Atoms. 81-97
- view
  authority control:
- export record
  dblp key:
  - conf/ilp/SchouterdenDB19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/SchouterdenDB19
Jonas Schouterden, Jesse Davis, Hendrik Blockeel:
LazyBum: Decision Tree Learning Using Lazy Propositionalization. 98-113
- view
  authority control:
- export record
  dblp key:
  - conf/ilp/SciammarellaZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/SciammarellaZ19
Tatiana Sciammarella, Gerson Zaverucha:
Weight Your Words: The Effect of Different Weighting Schemes on Wordification Performance. 114-128
- view
  authority control:
- export record
  dblp key:
  - conf/ilp/SpeichertB19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/SpeichertB19
Stefanie Speichert, Vaishak Belle:
Learning Probabilistic Logic Programs over Continuous Data. 129-144

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.