• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
2
0
0

Texte intégral

(1)

Preface

The 29th edition of the Italian Convention of Computational Logic (CILC 2014), the annual meeting organized by GULP (Gruppo ricercatori e Utenti Logic Pro- gramming), was hosted by the University of Turin, from June the 16th to June the 18th 2014.

Since the first conference, which took place in Genoa in 1986, the annual conference organized by GULP is the most important occasion for meeting and exchanging ideas and experiences between Italian researchers, working in the field of computational logic. Over the years, CILC has extended its topics of interest, from the traditional logic programming to most general ones, such as the declarative programming and the application of computational logic to Artificial Intelligence and Deductive Databases.

The technical program of CILC 2014 included 29 presentations. Di↵erent topics related to computational logic have been addressed, including verification of logic programs, answer set programming, proof theory, computable set the- ory, machine learning, constraint logic programming, description logics, semantic web, inductive logic programming, argumentation. Associated papers (21 full pa- pers, 8 short contributions) have been selected for publication in the proceedings of the event.

The 29th edition of CILC included also two invited talks:

– “From logic programming to argumentation and back”, given by Francesca Toni from the Department of Computing, Imperial College London;

– “Tractable approaches to consistent query answering in ontology-based-data access”, given by Riccardo Rosati from DIAG (Dipartimento di Ingegneria informatica, automatica e gestionale), Sapienza Universit`a di Roma).

A selection of the accepted papers will appear in a special issue of a scientific journal. The complete program with links to full papers is available at http:

//cilc2014.di.unipmn.it/accepted.php.

We have been able to organize CILC 2014 thanks to the support of the:

– Department of Computer Science of the University of Turin;

– Department of Science and Technological Innovation (DISIT) of the Univer- sity of Piemonte Orientale `OAmedeo Avogadro ´O

– Association for Logic Programming (ALP)

– Gruppo ricercatori e Utenti Logic Programming (GULP)

– Gruppo Nazionale per il Calcolo Scientifico (GNCS) of the Istituto Nazionale di Alta Matematica (INDAM) Turismo Torino e Provincia.

We would also like to thank all the people who have contributed to the success of CILC 2014, including authors, speakers, reviewers, participants and local or- ganizers, in particular Daniele Theseider Dupr´e and Matteo Spiotta. A special

3

(2)

thanks goes to the President of GULP, Agostino Dovier, and the secretary of GULP, Marco Gavanelli, for their helpful suggestions and support to the orga- nization of the event.

June 2014 Laura Giordano, Valentina Gliozzi, Gian Luca Pozzato

4

Références

Documents relatifs

The 33rd edition of the Italian Convention of Computational Logic (CILC 2018), the annual meeting organized by GULP (Gruppo ricercatori e Utenti Logic Programming), was hosted by

Original English edition was published by the World Health Organization in 2014 Under the title Yaws Recognition Booklet for Communities.. Copyright in the original edition is

On the other hand, the logic of segregation derives from a limitlessness produced by the abolition of borders and thus results from a logic of sepa- ration and limit, even if

Since the work of Rabin [9], it has been known that any monadic second order property of the (labeled) binary tree with successor functions (and not the prefix ordering) is a monadic

Given a signature R, let’s consider a classical first-order logic language with equality (FOL) over the decomposed signature R, as it has been defined in Sec- e tion 2; FOL has

Starting from our previous experience on Multi Agent Systems, we exploited the framework SCIFF in two ways: as a specification language, to support the definition of exercises in

As far as wff without free variables are concerned the axioms of the Heyting propositional calculus are transformed into theorems of

Adiante, no capítulo 17, Rescher oferece um quadro no qual ele descreve as insolubilia como questões que possuem respostas corretas, mas cujas inteligências finitas são incapa- zes