ADG 2016
Eleventh International Workshop on Automated Deduction in Geometry
Strasbourg, June, 27-29
http://icube-web.unistra.fr/adg2016/
******************************************************************
*****
*****
***** New submission deadline: Mai 2
*****
*****
*****
******************************************************************
EXTENDED DEADLINE Mai 2
Overview:
ADG is a forum to exchange ideas and views, to present research results and
progress, and to demonstrate software tools at the intersection between
geometry and automated deduction. The workshop is held every two years. The
previous editions of ADG were held in Coimbra in 2014, Edinburgh in 2012,
Munich in 2010, Shanghai in 2008, Pontevedra in 2006, Gainesville in 2004,
Hagenberg in 2002, Zurich in 2000, Beijing in 1998, and Toulouse in 1996.
The 11th edition, ADG 2016, will be held in Strasbourg, France, June 27 –
29, 2016.
Scope:
Relevant topics include (but are not limited to):
polynomial algebra, invariant and coordinate-free methods,
probabilistic, synthetic, and logic approaches, techniques for automated
geometric reasoning from discrete mathematics, combinatorics, and numerics;
symbolic and numeric methods for geometric computation, geometric
constraint solving, automated generation/reasoning and manipulation with
diagrams;
design and implementation of geometry software, special-purpose tools,
automated theorem provers, experimental studies;
applications of ADG to mechanics, geometric modelling, CAGD/CAD, computer
vision, robotics and education.
Submission Guidelines:
We invite the following types of submissions:
Extended abstracts
Full paper (maximum 20 pages)
The extended abstracts must address the following aspects explicitly.
Problem: What is the problem/question/objective?
Motivation: Why do we work on the problem? What is the importance?
State of the Art: What has been done already on the problem?
Contribution: What is the main original contribution?
Main Idea: What is the main idea underlying the contribution?
The submissions should follow the standard Springer LNCS Proceedings format.
Electronic submission as PDF is required via EasyChair (at
http://www.easychair.org/conferences/?conf=adg2016).
If you have any problems with the submission of your paper, or questions
concerning ADG 2016 or EasyChair, please contact adg2...@easychair.org.
Refereeing and Publication:
The submitted contributions will be subject to a summary review by the
Program Committee, bearing in mind that this first review is mainly for
presentation, NOT for publication.
Digital publication of the full papers accepted for presentation will be
available at the workshop.
The authors of the full papers accepted for presentation at the workshop
will be to submit their full and/or revised papers for publication in a
formal proceedings of ADG 2016 after the workshop.
The full papers (submitted after the meeting) will be formally reviewed by
PC members and external referees.
All participants are encouraged to bring along posters on their geometric
work (irrespective of whether it was presented at the workshop or not) for
display during ADG 2016.
The accepted full papers will be published in the Springer Lecture Notes in
Artificial Intelligence (LNAI) series or Lecture Notes in Computer Science
(LNCS) series.
The proceedings of ADG 1996, ADG 1998, ADG 2000, ADG 2002, and ADG 2004,
ADG 2006, ADG 2010, ADG 2012 and ADG 2014 appeared as LNAI 1360, LNAI
1669, LNAI 2061, LNAI 2930, LNAI 3763, LNAI 4869, LNCS 6877, LNAI 7993 and
LNAI 9201 respectively.
Invited Speakers:
Predrag Janicic, Faculty of Mathematics, University of Belgrade
Title: Geometrisation of Geometry
Abstract: Coherent logic (CL) or geometry logic is a (semi-decidable)
fragment of FOL that can be considered to be an extension of resolution
logic. CL is suitable for formalization and automation of various
mathematical theories, including geometry. This talk will give an overview
of developments in geometry based on CL: automated theorem provers for CL,
CL-based formalizations of geometry, CL-based proof representation for
geometry, links between CL and geometry construction problems, links
between CL and geometrical illustrations, etc.
Dominique Michelucci, University of Burgundy.
Title: Solving Constraints without Equations, Why and How
Abstract: Classically, when we solve geometric constraints, the latter are
represented with mathematical equations, or inequalities. These equations
or inequalities are represented explicitly, with trees or DAGs or
polynomials, etc. So it is easy to symbolically compute derivatives, etc.
It is possible to make proofs of geometric theorems.
But, recently, we meet more and more frequently problems for which
equations are not available for many reasons, e.g. when the shape is the
result of a procedure (subdivision surfaces; fractals). In this new
framework, shapes or geometric figures are the results of the evaluation of
black box procedures / algorithms / subprograms, feed with some parameters.
These programs contain if-then-else constructs, loops, they compute fixed
points, they call ODE and PDE solvers. Some parameters are free : how to
compute their values to satisfy specified constraints ? How to solve
without equations ?
Program Committee
Chair: Ileana Streinu (USA)
Members:
Michael Beeson (USA)
Francisco Botana (Spain)
John Bowers (USA)
Xiaoyu Chen (China)
Xiao-Shan Gao (China)
Tetsuo Ida (Japan)
Filip Maric (Serbia)
Pascal Mathis (France)
Julien Narboux (France)
Pavel Pech (Czech Republic)
Pedro Quaresma (Portugal)
Tomas Recio (Spain)
Pascal Schreck (France)
Meera Sitharam (USA)
Dongming Wang (China)
Bican Xia (China)
------------------------------------------------------------------------------
Find and fix application performance issues faster with Applications Manager
Applications Manager provides deep performance insights into multiple tiers of
your business applications. It resolves application problems quickly and
reduces your MTTR. Get your free trial!
https://ad.doubleclick.net/ddm/clk/302982198;130105516;z
_______________________________________________
hol-info mailing list
hol-info@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hol-info
