[DL] UNIF cfp
Franz Baader
baader at tcs.inf.tu-dresden.de
Fri Jan 15 14:10:04 CET 2016
Dear DL colleagues,
please note that UNIF is also interested in unification/matching and
related inferences in Description Logics.
Best regards,
-Franz
==========================================================
Call for Papers
UNIF 2016
The 30th International Workshop on Unification
June 26, 2016, Porto, Portugal
http://users.mat.unimi.it/users/ghilardi/UNIF2016/
*********
part of the First International Conference on
Formal Structures of Computation and Deduction
(FSCD'16)
==========================================================
UNIF 2016 is the 30th event in a series of international
meetings devoted to unification theory and its applications.
Unification is concerned with the problem of making two
terms equal, finding solutions for equations, or
making formulas equivalent. It is a fundamental process
used in a number of fields of computer science,
including automated reasoning, term rewriting,
logic programming, natural language processing,
program analysis, types, etc.
The International Workshop on Unification (UNIF) is a yearly
forum for researchers in unification theory and related
fields to meet old and new colleagues, to present recent
(even unfinished) work, and to discuss new ideas and trends.
It is also a good opportunity for young researchers and
scientists working in related areas to get an overview of the
current state of the art in unification theory.
Topics of Interest
------------------
A non-exhaustive list of topics of interest include:
- Unification algorithms, calculi and implementations
- Equational unification and unification modulo theories
- Unification in modal, temporal and description logics
- Admissibility of inference rules
- Narrowing
- Matching algorithms
- Constraint solving
- Combination problems
- Disunification
- Higher-Order unification
- Type checking and reconstruction
- Typed unification
- Complexity issues
- Query answering
- Implementation techniques
- Applications of unification
- Antiunification/Generalization
Submission
----------
Following the tradition of UNIF, we call for submissions of
abstracts (5 pages) in EasyChair style, to be submitted
electronically as PDF files through the EasyChair submission
site:
https://easychair.org/conferences/?conf=unif2016
Abstracts will be evaluated by the Programme Committee
(if necessary with support from external reviewers)
regarding their significance for the workshop. Accepted
abstracts will be presented at the workshop and included in
the informal proceedings of the workshop, available in printed
form at the workshop and in electronic form from the UNIF
homepage:
http://www.pps.jussieu.fr/~treinen/unif/
Based on the number and quality of submissions we will decide
whether to organise a special journal issue.
Important Dates
---------------
* Paper Submission: May 1, 2016
* Notification of Acceptance: May 29 2016
* Final version: June 5, 2016
* Conference: June 26, 2016
Programme Committee
-------------------
* Franz Baader, TU Dresden, Germany
* Philippe Balbiani, IRIT Toulouse, France
* Wojciech Dzik, University of Silesia, Katowice, Poland
* Santiago Escobar, Universitat Politecnica de Valencia, Spain
* Adria Gascon, University of Edinburgh, UK
* Silvio Ghilardi, Universita di Milano, Italy (co-chair)
* Artur Jez, Instytut Informatyki, Wroclaw, Poland
* Temur Kutsia, RISC, Johannes Kepler University Linz, Austria
* Jordi Levy, IIIA-CSIC, Spain
* Christopher Lynch, Clarkson University, USA
* George Metcalfe, University of Bern, Switzerland
* Barbara Morawska, TU Dresden, Germany
* Paliath Narendran, University at Albany-SUNY, USA
* Christophe Ringeissen, LORIA-INRIA Lorraine, France
* Manfred Schmidt-Schauss, Goethe-University Frankfurt, Germany (co-chair)
* Mateu Villaret, Universitat de Girona, Spain
For more information, please contact any of the two chairs
Silvio Ghilardi and Manfred Schmidt-Schauß
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.zih.tu-dresden.de/pipermail/dl/attachments/20160115/92bdd7b2/attachment.htm>
More information about the dl
mailing list