default search action

combined dblp search
author search
venue search
publication search

ask others

22nd ILP 2012: Dubrovnik, Croatia

> Home > Conferences and Workshops > ILP

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

- view
- export record
  dblp key:
  - conf/ilp/2012lbr
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/2012lbr
Fabrizio Riguzzi, Filip Zelezný:
Late Breaking Papers of the 22nd International Conference on Inductive Logic Programming, Dubrovnik, Croatia, September 17-19, 2012. CEUR Workshop Proceedings 975, CEUR-WS.org 2013
- view
  - electronic edition @ ceur-ws.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/ilp/DinhVE12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/DinhVE12
Quang-Thang Dinh, Christel Vrain, Matthieu Exbrayat:
A Link-Based Method for Propositionalization. 10-25
- view
  - electronic edition @ ceur-ws.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/ilp/DoncescuID12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/DoncescuID12
Andrei Doncescu, Katsumi Inoue, Jacques Demongeot:
MicroRNAs Robustness in Genetic Regulatory Networks. 26-37
- view
  - electronic edition @ ceur-ws.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/ilp/GoncalvesOLC12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/GoncalvesOLC12
António Gonçalves, Irene M. Ong, Jeffrey A. Lewis, Vítor Santos Costa:
A Problog Model for Analyzing Gene Regulatory Networks. 38-43
- view
  - electronic edition @ ceur-ws.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/ilp/KanamoriO12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/KanamoriO12
Katsutoshi Kanamori, Hayato Ohwada:
Creative Problem Solving by Concept Generation Using Relation Structure. 44-49
- view
  - electronic edition @ ceur-ws.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/ilp/NishioMI12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/NishioMI12
Noriaki Nishio, Atsuko Mutoh, Nobuhiro Inuzuka:
On Computing Minimal Generators in Multi-Relational Data Mining with respect to theta-Subsumption. 50-55
- view
  - electronic edition @ ceur-ws.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/ilp/PerovsekVL12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/PerovsekVL12
Matic Perovsek, Anze Vavpetic, Nada Lavrac:
A Wordification Approach to Relational Data Mining: Early Results. 56-61
- view
  - electronic edition @ ceur-ws.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/ilp/RavkicRD12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/RavkicRD12
Irma Ravkic, Jan Ramon, Jesse Davis:
Hybrid Logical Bayesian Networks. 62-67
- view
  - electronic edition @ ceur-ws.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/ilp/BergheHBBJ12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/BergheHBBJ12
Alexander van Den Berghe, Jan Van Haaren, Stefan Van Baelen, Yolande Berbers, Wouter Joosen:
Towards an Automated Pattern Selection Procedure in Software Models. 68-73
- view
  - electronic edition @ ceur-ws.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/ilp/YamamotoII12b
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ilp/YamamotoII12b
Yoshitaka Yamamoto, Koji Iwanuma, Katsumi Inoue:
Non-monotone Dualization via Monotone Dualization. 74-79

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.