Date: Tue, 29 Oct 1996 18:23:42 +0100 (MET)
From: Chandrabose ARAVINDAN <arvind@informatik.uni-koblenz.de>
To: ai+ai-jobs@cs.cmu.edu, ai+ai-postdoc@cs.cmu.edu
Subject: Postdoc: Research Position Available
Message-ID: <Pine.SUN.3.95.961029182250.6334O-100000@meyer>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Sender: ai@A.GP.CS.CMU.EDU

\documentstyle[12pt]{article}
\pagestyle{empty}
\parindent 0cm
\topmargin-2cm
\textheight28cm
\addtolength{\textwidth}{2cm}
\addtolength{\oddsidemargin}{-1cm}

\begin{document}

\begin{center}

{\large \bf ONE RESEARCH POSITION}\\                      

\vspace{3mm}

{\bf available in the Research Group\\ARTIFICIAL INTELLIGENCE\\
Department of Computer Science\\
University of Koblenz-Landau\\
http://www.uni-koblenz.de/ag-ki/}

\end{center}

\vspace*{10mm}

Our group consists (by now) of 7 researchers and 1 PhD student 
(Head: Prof.~U.~Furbach) who  
are engaged in basic research and application-oriented development 
in the areas of ``AUTOMATED REASONING'', ``NON-MONOTONIC REASONING'' 
and ``DEDUCTIVE DATABASES''.\\
 
We are looking for an outstanding scientific staff (Post-Doc) for our 
research project on {\em Disjunctive Logic Programming\/}
(headed by Dr.~J.~Dix and Prof.~U.~Furbach, please consult
our web-page http://www.uni-koblenz.de/ag-ki/DLP/). This project is 
funded by the DFG (German Research Council) and 
the research position will be available from 
January 1, 1997, for the rest of the year. 
An extension for another 2 years is very likely, but depends on the
evaluation of the project in March-April 1997.
Salaries are payed according to BAT IIa.\\


The main aim of the project is to develop a programming
system which realizes various semantics for (extended) disjunctive
logic programs with negation. 
The underlying idea to achieve this goal is to 
combine {\em classical theorem proving\/}-technology
with methods from {\em non-monotonic reasoning\/} in knowledge
representation.
In particular we want to  (1) extend  PROLOG-like languages
by disjunction and various sorts of negation,
(2) develop  efficient implementations 
that can be applied  in practice,
(3) investigate their use for nontrivial applications.
The basis of the
system to be developed is PROTEIN, a first-order PTTP-like theorem
prover based on model-elimination calculus that does not use
contrapositives of the given clauses.
\\

We prefer candidates having a PhD in Computer Science or a comparable
qualification. Previous experience in either {\em Automated Theorem Proving\/}
or {\em Nonmonotonic Reasoning\/} is  indispensable (knowledge in both
fields is even better). Although knowledge of German is not presupposed, basic
knowledge will be appreciated.


\vspace{.4cm}

Please send your application documents as soon as possible to: \\
                                                                          
Dr.~J\"{u}rgen Dix\\
Institut f\"ur Informatik\\
Universit\"at Koblenz-Landau\\
Rheinau 1, D-56075 Koblenz, Germany\\
{\em Fax:\/} +49-261-9119-496\\
{\em E-mail:\/} dix@informatik.uni-koblenz.de\\

We would appreciate to receive from applicants --- as soon as
possible --- a short notification of interest (preferably by e-mail)
containing a short description of the applicant's qualification: e.g.
short CV, a list of publications, summary of master thesis or of Ph.D.
thesis, etc. 

\end{document}


-------------------------------------------------------------------------------
This message    | Submissions                       ai+ai-postdoc@cs.cmu.edu
was sent via    | Subscribe/Unsubscribe             ai+query@cs.cmu.edu
the AI-POSTDOC  | Available mailing lists include
mailing list.   |    AI-JOBS, LISP-JOBS, PROLOG-JOBS, AI-POSTDOC, AI-PREDOC