Anastasia Paparrizou

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Dino Pedreschi

> Home > Persons > Anastasia Paparrizou

Publications

2017
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/expert/BessiereRGKNNOP17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/expert/BessiereRGKNNOP17
Christian Bessiere, Luc De Raedt, Tias Guns, Lars Kotthoff, Mirco Nanni, Siegfried Nijssen, Barry O'Sullivan, Anastasia Paparrizou, Dino Pedreschi, Helmut Simonis:
The Inductive Constraint Programming Loop. IEEE Intell. Syst. 32(5): 44-52 (2017)
2016
[p1]
- view
  authority control:
- export record
  dblp key:
  - series/lncs/BessiereRGKNNOPPS16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/lncs/BessiereRGKNNOPPS16
Christian Bessiere, Luc De Raedt, Tias Guns, Lars Kotthoff, Mirco Nanni, Siegfried Nijssen, Barry O'Sullivan, Anastasia Paparrizou, Dino Pedreschi, Helmut Simonis:
The Inductive Constraint Programming Loop. Data Mining and Constraint Programming 2016: 303-309
2015
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BessiereRGKNNOP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BessiereRGKNNOP15
Christian Bessiere, Luc De Raedt, Tias Guns, Lars Kotthoff, Mirco Nanni, Siegfried Nijssen, Barry O'Sullivan, Anastasia Paparrizou, Dino Pedreschi, Helmut Simonis:
The Inductive Constraint Programming Loop. CoRR abs/1510.03317 (2015)

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.