Difference between revisions of "ILP 2019"

From OPENRESEARCH fixed Wiki
Jump to navigation Jump to search
(modified through wikirestore by orapi)
(modified through wikirestore by orapi)
Line 13: Line 13:
 
|Registration link=https://ilp2019.org/fees-and-registration/
 
|Registration link=https://ilp2019.org/fees-and-registration/
 
|Acronym        =ILP 2019
 
|Acronym        =ILP 2019
|End date      =2019/09/05
+
|End date      =2019-09-05
 
|Series        =ILP
 
|Series        =ILP
 
|Type          =Conference
 
|Type          =Conference
Line 19: Line 19:
 
|State          =BG/16
 
|State          =BG/16
 
|City          =BG/16/Plovdiv
 
|City          =BG/16/Plovdiv
 +
|Year          =2019
 
|Homepage      =https://ilp2019.org/
 
|Homepage      =https://ilp2019.org/
|Start date    =2019/09/03
+
|Start date    =2019-09-03
 
|Title          =29th International Conference on Inductive Logic Programming}}
 
|Title          =29th International Conference on Inductive Logic Programming}}
 
''Enter your description here. Maybe just paste in the call for papers.''
 
''Enter your description here. Maybe just paste in the call for papers.''

Revision as of 03:55, 19 November 2021


Event Rating

median worst
Pain1.svg Pain5.svg

List of all ratings can be found at ILP 2019/rating

ILP 2019
29th International Conference on Inductive Logic Programming
Event in series ILP
Dates 2019-09-03 (iCal) - 2019-09-05
Homepage: https://ilp2019.org/
Location
Location: BG/16/Plovdiv, BG/16, BG
Loading map...

Important dates
Submissions: 2019/06/03
Registration link: https://ilp2019.org/fees-and-registration/
Early bird student: € 245 / {{{Early bird fee reduced}}} (reduced)
On site student: € 390 / {{{On site fee reduced}}} (reduced)
Early bird regular: € 380
On site regular: € 565
Committees
Organizers: Dimitar Kazakov
PC chairs: Dimitar Kazakov
PC members: Dalal Alrajeh, Annalisa Appice, Alexander Artikis, Elena Bellodi, Hendrik Blockeel, Agnès Braud, Krysia Broda
Keynote speaker: Atanas Kiryakov, Viktor Ivanov
Table of Contents

Enter your description here. Maybe just paste in the call for papers.