[Om-announce] Call for Participation: Kiel Declarative Programming Days 2013
Ricardo Rocha
ricroc at dcc.fc.up.pt
Mon Aug 12 18:27:38 CEST 2013
**************************
* Call for Participation *
**************************
Kiel Declarative Programming Days 2013
September 11-13, 2013
http://www-ps.informatik.uni-kiel.de/kdpd2013/
--------------------------------------------------------------------
Early registration (and hotel reservation) deadline: August 15, 2013
--------------------------------------------------------------------
The Kiel Declarative Programming Days 2013 unifies the following events:
* 20th International Conference on Applications of Declarative
Programming
and Knowledge Management
(INAP 2013, http://www.dcc.fc.up.pt/INAP-2013/)
* 22nd International Workshop on Functional and (Constraint) Logic
Programming
(WFLP 2013, http://www-ps.informatik.uni-kiel.de/wflp2013/)
* 27th Workshop on Logic Programming
(WLP 2013, http://www-ps.informatik.uni-kiel.de/wflp2013/)
All events will be jointly organized. Look at the web sites
about detailed registration, accommodation, and travel information.
======================================================================
TECHNICAL PROGRAM
The technical program includes:
INVITED TALK:
Tom Schrijvers (University of Ghent):
Delimited Continuations for Prolog: An Overview
ACCEPTED PAPERS:
James Gil de Lamadrid:
FOBS-X: An Extensible Hybrid Functional-Object-Oriented Scripting
Language
Marcus Ermler:
Towards a Verification Framework for Haskell by Combining
Graph Transformation Units and SAT Solving
Nikita Danilenko:
And... Action! - Monoid Acts and (Pre)orders
Chiaki Sakama:
Debate Games in Logic Programming
Alexander Bau and Johannes Waldmann:
Propositional Encoding of Constraints over Tree-Shaped Data
Marcus Ermler:
A SAT-Based Graph Rewriting and Verification Tool implemented in
Haskell
Carlos Alberto MartÃnez-Angeles, Ines Dutra, VÃtor Santos-Costa
and Jorge Buenabad-Chavez:
A Datalog Engine for GPUs
Mingmin Chen, Shizhuo Yu, Nico Franz, Shawn Bowers and Bertram
Ludascher:
uler/X: A Toolkit for Logic-based Taxonomy Integration
Jomu George Mani Paret and Otmane Ait Mohamed:
Coverage Driven Test Generation and Consistency Algorithm
Alexander Å imko:
Extension of Gelfond-Lifschitz Reduction for Preferred Answer Sets:
Preliminary Report
Christoph Beierle and Udo Lelitko:
On an Approach to Implementing Exact Real Arithmetic in Curry
Claus Zinn:
Heuristic Search Over Program Transformations
Baltasar Trancón Y Widemann and Markus Lepper:
Some Experiments on Light-Weight Object-Functional-Logic Programming
in Java with Paisley
Ella Albrecht, Patrick Krümpelmann and Gabriele Kern-Isberner:
Construction of Explanation Graphs from Extended Dependency Graphs
for Answer Set Programs
Mário Abrantes and LuÃs Moniz Pereira:
An Abductive Paraconsistent Semantics -- MHp
Benny Höckner, Petra Hofstedt, Peter Sauer, Thilo Voertler and
Thomas Hinze:
Constraint-based Approach for an Early Inspection of the
Feasibility of Cyber Physical Systems
Thomas Eiter, Michael Fink, Thomas Krennwallner and Christoph Redl:
HEX-Programs with Existential Quantification
Guohua Liu, Tomi Janhunen and Ilkka Niemela:
Introducing Real Variables and MIP Objective Functions
to Answer Set Programming
Mikus Vanags, Arturs Licis and Janis Justs:
Meta-set calculus as mathematical basis for creating abstract,
structured data store querying technology
Gerald Berger and Hans Tompits:
On Axiomatic Rejection for the Description Logic ALC
Rana Awada, Pablo Barcelo and Iluju Kiringa:
Sharing and Exchanging Data
Ludwig Ostermayer, Geng Sun and Dietmar Seipel:
Simplifying Rules Creation Using Domain Specific Languages in Drools
Danny Munera, Daniel Diaz and Salvador Abreu:
Towards Parallel Constraint-Based Local Search with the X10 Language
----------------------------------------------------------------------
CONTACT
Prof. Michael Hanus
Institut fuer Informatik
Christian-Albrechts-Universitaet zu Kiel
D-24098 Kiel, Germany
Phone: ++49-431-880-7271 or -7270 (Secr.)
Fax : ++49-431-880-7613
Email: mh at informatik.uni-kiel.de
----------------------------------------------------------------------
More information about the Om-announce
mailing list