<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Additional Reviewers</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bellodi</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Elena H</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>This volume contains the Late Breaking Papers of ILP 2013: the 23rd International Conference on Inductive Logic Programming held on August 28-30, 2014 in Rio de Janeiro, Brazil. The ILP conference series, started in 1991, is the premier international forum on learning from structured data. Originally focusing on the induction of logic programs, it broadened its scope and attracted a lot of attention and interest in recent years. The conference now focuses on all aspects of learning in logic, multi-relational learning and data mining, statistical relational learning, graph and tree mining, relational reinforcement learning, and other forms of learning from structured data. This edition of the conference solicited three types of submissions: 1. long papers (12 pages) describing original mature work containing appropriate experimental evaluation and/or representing a self-contained theoretical contribution. 2. short papers (6 pages) describing original work in progress, brief accounts of original ideas without conclusive experimental evaluation, and other relevant work of potentially high scienti c interest but not yet qualifying for the above category. 3. papers relevant to the conference topics and recently published or accepted for publication by a rst-class conference such as ECML/PKDD, ICML, KDD, ICDM, etc., or journals such as MLJ, DMKD, JMLR, etc. We received 42 submissions, 18 long, 21 short submissions, and 3 previously published papers. Each submission was reviewed by at least 3 program committee members. The short papers were evaluated on the basis of both the submitted manuscript and the presentation at the conference. Accepted papers presenting work in progress, i.e., reports on ongoing research are collected in this volume. The conference program included 3 invited talks. Professor Jure Leskovec introduced on-going work on Exploring the Structure of On-Line Networks and Communities. Social interactions of hundreds of millions of people on the Web create massive digital traces, which can naturally be represented, studied and analyzed as massive networks of interactions. By computationally analyzing such network data we can study phenomena that were once essentially invisible to us: the social interactions and collective behavior of hundreds of millions of people. In his talk he discussed how computational perspectives and mathematical models can be developed to abstract online social phenomena like: How will a community or a social network evolve in the future? What are emerging ideas and trends in the network? How does information ow and mutate as it is passed from a node to node like an epidemic? Professor Hendrik Blockeel discussed Lifted variable elimination: faster correct inference in probabilistic-logical models. He started from an intriguing observation, that rst-order logic allows inference on the level of variables, that is, we can reason about an object's properties without knowing the object. This boosts inference e ciency. It is not yet clear to what extent probabilistic inference can, similarly, be "lifted" to the level of logical variables. In recent years,</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>i
many results have been obtained that contribute towards solving this question.
A number of them were discussed in his talk, focusing on intuition rather than
technical detail. He discussed how variable elimination, perhaps the simplest
approach to probabilistic inference, can be lifted by identifying and exploiting
particular kinds of symmetry in a probabilistic-logical model. He also discussed
a number of theoretical and experimental results, both positive and negative,
that provide insight into the circumstances under which lifting is (not) possible.</p>
      <p>Professor William W. Cohen discussed Learning to Construct and Reason
with a Large Knowledge Base of Extracted Information. Carnegie Mellon
University's "Never Ending Language Learner" (NELL) has been running for over
three years, and has automatically extracted from the web millions of facts
concerning hundreds of thousands of entities and thousands of concepts. NELL
works by coupling together many interrelated large-scale semi-supervised
learning problems. In this talk he discussed some of the technical problems the group
encountered in building NELL, and some of the issues involved in reasoning with
this sort of large, diverse, and imperfect knowledge base. Professor Cohen
presented joint work with Tom Mitchell, Ni Lao, William Wang, and many other
colleagues.</p>
      <p>The General Chair was Gerson Zaverucha, the Program Chairs were
Gerson Zaverucha and V tor Santos Costa, and the Local Chair was Aline Marins
Paes. We would like to thank the guest speakers for coming to ILP'13 and for
their availability during the Conference. The conference was kindly sponsored
by FAPERJ, the Fundac~ao de Amparo a Pesquisa do Estado do Rio de Janeiro
through grant E-26/101.541/2010. The Universidade Federal do Rio de Janeiro
(UFRJ) generously supported ILP'13 by allowing us to use the conference venue,
Casa da Ci^encia. We would like to thank its helpful sta : Camila Costa, Angela
Monteiro and Claudia Pereira. We would like to thank Maria de Fatima Cruz
Marques for her valuable suggestions. V tor Santos Costa was supported by
the grant SIBILA, NORTE-07-0124-FEDER-000059, and the FCT grants ADE,
PTDC/EIA-EIA/121686/2010, and ABLe, PTDC/EEI-SII/2094/2012
(FCOMP01-0124-FEDER-029010). The Machine Learning journal supported research in
this area by opening a special number on ILP'13. Springer Verlag will publish
the ILP'13 main proceedings, and CEUR is publishing the late breaking
papers. We would like to thank Easychair.org for supporting submission handling.
Last, but not least, we would like to thank the Local Organizing Committee:
Kate Revoredo and Fernanda Bai~ao helped throughout in the organization, and
Roosevelt Sardinha created and maintained the web-site.</p>
      <p>June, 2014
Rio de Janeiro and Porto
Gerson Zaverucha
V tor Santos Costa</p>
      <p>Aline Marins Paes
Gerson Zaverucha
Program Chairs
Gerson Zaverucha
V tor Santos Costa
Local Chair</p>
    </sec>
    <sec id="sec-2">
      <title>Local Organizing Committee</title>
      <sec id="sec-2-1">
        <title>Kate Revoredo Fernanda Bai~ao Roosevelt Sardinha</title>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Program Committee</title>
      <sec id="sec-3-1">
        <title>Erick Alphonse</title>
        <p>Annalisa Appice
Hendrik Blockeel
Ivan Bratko
Rui Camacho
James Cussens
Luc De Raedt
Saso Dzeroski
Nicola Fanizzi
Stefano Ferilli
Peter Flach
Nuno Fonseca
Paolo Frasconi
Tamas Horvath
Katsumi Inoue
Aline Marins Paes
Universidade Federal Fluminense
COPPE { Universidade Federal do Rio de Janeiro
COPPE { Universidade Federal do Rio de Janeiro
CRACS/INESC-TEC &amp; DCC-FCUP
Universidade Federal do Estado do Rio de Janeiro
Universidade Federal do Estado do Rio de Janeiro
COPPE - Universidade Federal do Rio de Janeiro</p>
      </sec>
      <sec id="sec-3-2">
        <title>LIPN - UMR CNRS 7030</title>
        <p>Dipartimento di Informatica, Universita di Bari
K.U. Leuven
University of Ljubljana
LIACC/FEUP University of Porto
University of York
Katholieke Universiteit Leuven
Jozef Stefan Institute
Dipartimento di Informatica, Universita di Bari
Universita di Bari
University of Bristol
CRACS-INESC Porto LA &amp; EMBL-EBI
Universita degli Studi di Firenze
University of Bonn and Fraunhofer IAIS
NII, National Institute of Informatics
Nobuhiro Inuzuka Nagoya Institute of Technology
Andreas Karwath University of Mainz
Kristian Kersting University of Dortmund
Ross King University of Manchester
Ekaterina Komendantskaya School of Computing, University of Dundee
Stefan Kramer University of Mainz
Nada Lavrac Jozef Stefan Institute
Francesca Alessandra Lisi Universita degli Studi di Bari "Aldo Moro"
Donato Malerba Dipartimento di Informatica, Universita di Bari
Stephen Muggleton Department of Computing, Imperial College London
Sriraam Natarajan University of Indiana
Ramon Otero University of A Corun~a
Aline Paes Universidade Federal Fluminense
C. David Page University of Wisconsin { Madison
Bernhard Pfahringer University of Waikato
Ganesh Ramakrishnan IIT Bombay
Jan Ramon K.U.Leuven
Oliver Ray University of Bristol
Fabrizio Riguzzi University of Ferrara
Celine Rouveirol LIPN, Universite Paris 13
Chiaki Sakama Wakayama University
Claude Sammut University of New South Wales
Jude Shavlik University of Wisconsin { Madison
Takayoshi Shoudai Department of Informatics, Kyushu University
Ashwin Srinivasan IBM India Research Lab
Alireza Tamaddoni-Nezhad Imperial College, London
Tomoyuki Uchida Hiroshima City University
Christel Vrain LIFO - University of Orleans
Stefan Wrobel Fraunhofer IAIS &amp; Univ. of Bonn
Akihiro Yamamoto Kyoto University
Filip Zelezny Czech Technical University
Heras, Jonathan
M
Manine, Alain-Pierre
S
Sato, Taisuke</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list />
  </back>
</article>