• Aucun résultat trouvé

About WLP 2014

N/A
N/A
Protected

Academic year: 2022

Partager "About WLP 2014"

Copied!
2
0
0

Texte intégral

(1)

About WLP 2014

Preface

The first part of this volume contains the papers presented at WLP 2014, the 28th Workshop on (Constraint) Logic Programming. The workshop was held on September 15-17, 2014 in Wittenberg, at the Leucorea Conference Center of Halle-Wittenberg University.

The Workshops on (Constraint) Logic Programming are the annual meeting of the German Society of Logic Programming (GLP) and bring together re- searchers interested in logic programming, constraint programming, answer set programming, and related areas like databases and artificial intelligence (not only from Germany). Previous workshops have been held in Germany, Austria, Switzerland and Egypt. The workshops provide a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning and knowledge repre- sentation, and facilitate interactions between research in theoretical foundations and in the design and implementation of logic-based programming systems. The WLP workshop series started 1988 in Berlin (in the first three years there were two workshops per year).

The workshop was jointly organized and located with the 23rd Interna- tional Workshop on Functional and (Constraint) Logic Programming (WFLP 2014). The WFLP workshops series is running since 1992 and brings together researchers interested in functional programming, logic programming, as well as their integration.

I thank the invited speaker, authors of papers, programme committee mem- bers, external reviewers, as well as the Leucorea team and my local organization staff Ramona Vahrenhold, Heike Stephan, and Alexander Hinneburg. I would also like to thank Johannes Waldmann for organizing WFLP 2014. It was a pleasure to work together.

September 12, 2014 Stefan Brass

(2)

Program Committee

Andreas Behrend (Universit¨at Bonn)

Christoph Beierle (FernUniversit¨at in Hagen)

Stefan Brass (Martin-Luther-Universit¨at Halle-Wittenberg, chair) Fran¸cois Bry (Ludwig-Maximilians-Universit¨at M¨unchen)

J¨urgen Dix (TU Clausthal) Thom Fr¨uhwirth (Universit¨at Ulm)

Michael Hanus (Christian-Albrechts-Universit¨at zu Kiel)

Petra Hofstedt (Brandenburgische Technische Universit¨at Cottbus) Michael Leuschel (Heinrich-Heine-Universit¨at D¨usseldorf)

Rainer Manthey (Universit¨at Bonn)

Dietmar Seipel (Julius-Maximilians-Universit¨at W¨urzburg) Sibylle Schwarz (HTWK Leipzig)

Hans Tompits (TU Wien)

Armin Wolf (Fraunhofer FOKUS)

Additional Reviewers

Stephan Frank Gabriele Keller Ludwig Ostermayer

Local Organization

Stefan Brass

Alexander Hinneburg Heike Stephan Ramona Vahrenhold Johannes Waldmann

Références

Documents relatifs

By forging such a direct link between a proof checking kernel and a logic program, that kernel has access to backtracking search and unification, which means that it can be used

Unite´ de recherche INRIA Rocquencourt, Domaine de Voluceau, Rocquencourt, BP 105, 78153 LE CHESNAY Cedex Unite´ de recherche INRIA Sophia-Antipolis, 2004 route des Lucioles, BP

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

We consider the following properties: ease of model specification; robustness to input change; control over inductive bias; verification of specifications; post-hoc model editing;

P-SHIQ(D) uses probabilistic lexico- graphic entailment from probabilistic default reasoning and allows to annotate with a probabilistic interval both assertional and

The focus of the paper is the analysis of the programming style to be used for model- ing the maximum bisimulation problem in a way as declarative way as possible in some dialects

We prove that the selective unification problem is generally undecidable for constraint logic programs, and we present a correct and complete algorithm for selective unification in

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des