FTP in 2003
Main events of year 2003 concerning
First-order Theorem Proving
In the domain of Automated Deduction, research on First-order Theorem Proving (FTP) is very active. This theme involves theorem proving in first-order classical logic, many-valued logics, and modal logics. This includes resolution, equational reasoning, term rewriting, model construction, constraint reasoning, unification, description logics, propositional logic, and specialized decision procedures. Another important interest in FTP is the definition of strategies and complexity of theorem proving procedures. The applications of FTP are numerous: first-order theorem provers can be defined for tackling problems in verification, artificial intelligence, mathematics or education.
This site presents the two major events concerning research on First-order Theorem Proving (FTP) in 2003.
All the information concerning the preparation of this special issue (call for papers, submission deadline, date of publication,...) can be found at the following web page:
http://rewriting.loria.fr/FTP-2003/jar/The reference to this special issue is:
D. Kapur and L. Vigneron, editors. Special issue on First-Order Theorem Proving of the Journal of Automated Reasoning, Volume 33, Numbers 3-4, Springer Science+Business Media B.V., October 2004. ISSN: 0168-7433 (Paper) 1573-0670 (Online).
All the information concerning this event can be found at the following web page:
For more information on the FTP workshop series: http://www.mpi-sb.mpg.de/conferences/FTP-WS/.