[DL] Description Logic and Theorem Proving

[Mario Frank]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

Dear list members,

I am a (nearly graduate) CS student at University of Potsdam (Germany).
Currently I am trying to focus my plans for my PhD. During the last
years, I was researching in the field of theorem proving and attended
the CADE ATP Systems Competition twice (IJCAR 2012 and CADE 24) .

I learned on these conferences that theorem proving is also used for
description logics.

In order to focus my plans for my PhD, I am trying to get some
impressions about the experiences of implementers and users of theorem
provers (interactive and automated) and theorem proving assistents
(e.g. preprocessors for theorem proving).
The scope is to collect some information about the use of theorem
provers and the strengths and weaknesses which are seen by users.
Also, usually missing functionalities and gaps are in my scope.

Thus, I created a small survey which I would like to distribute.

Surely, all information given are treated as confidential and no
informations about the people who filled-in the survey will be disclosed.

The survey can be found at:
http://apache.cs.uni-potsdam.de/de/profs/ifi/theorie/deduction/theorem-proving-survey

Sincerly,
Mario Frank
Institute for Computer Science
University of Potsdam
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.11 (GNU/Linux)
Comment: Using GnuPG with undefined - http://www.enigmail.net/

iQEcBAEBAgAGBQJR0pCfAAoJEDnmHcItIfWEuPMIAKSjhjSn0CSk9zV+GrUsQZ4q
xcbPDvgr7Kfi/ZGrt8E7OcBU+NV+MjyjcjJ6it86+XPH0qo8K2TgzDnRKSTLF1o8
Tx/WIZm3ec+Y85LOcKO7sgeK3+8pgtOxOVVSqS2tJS7GnesrxnlZBT2U7I8Ksc33
Ko7yX2r4xctVW8lRmcQd2c1gG9VEdIkZ3y45mnKyJiWznqTOhc4VPMZG/Sb8wYJX
Y1z8lVNw1H+S83pm1rzoUhCYcCTpVUqydGKWdIsqndfBuq89Ajo+LEvQNIALqADh
nuF9CcozMFiEa2x8K5CJMwOAgjYbWmhqtrSKstOGkFRmseI2ny1IWRAtTSTQJlo=
=RRh+
-----END PGP SIGNATURE-----