International Workshop on First-Order Theorem Proving

The International Workshop on First-Order Theorem Proving (FTP) is a scientific meeting of researchers interested in automated theorem proving for first-order logic and related fields. FTP workshops are less formal than many conferences, but more formal than most workshops. While FTP proceedings are published informally, each FTP workshop has resulted in a special issue of a recognized peer-reviewed academic journal.

FTP is one of the constituent meetings of the International Joint Conference on Automated Reasoning, and is merged with this conference in years where it takes place.

FTP Meetings

* FTP'97 took place at the Research Institute for Symbolic Computation in Linz, Austria in Austria, October 27-28, 1997
* FTP'98 took place in Vienna, Austria, November 23 - 25, 1998
* FTP'00 took place in St. Andrews, Scotland, July 3-5, 2000
* In 2001 FTP was merged into the first IJCAR
* FTP'03 took place in Valencia, Spain, June 12-14, 2003, as part of the Federated Conference on Rewriting, Deduction and Programming.
* In 2004, FTP was merged into the second IJCAR
* FTP'05 took place in Koblenz, Germany, September 14-17, 2005
* In 2006, FTP was merged into the third IJCAR
* FTP'07 took place in Liverpool, United Kingdom, September 12-13, 2007
* In 2008, FTP was merged into the fourth IJCAR

External links

* [ International Workshops on First-Order Theorem Proving (FTP)]

Wikimedia Foundation. 2010.

Look at other dictionaries:

  • FTP (disambiguation) — FTP can refer to:* Federal Theater Project, a U.S. New Deal project * File Transfer Protocol used on the Internet ** List of FTP server software, a collection of applications which implement the protocol * Foiled twisted pair cabling * For ten… …   Wikipedia

  • P versus NP problem — Unsolved problems in computer science Is P = NP ? …   Wikipedia

  • Automated reasoning — is an area of computer science dedicated to understand different aspects of reasoning. The study in automated reasoning helps produce software which allows computers to reason completely, or nearly completely, automatically. Although automated… …   Wikipedia

  • 2-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …   Wikipedia

  • Actor model — In computer science, the Actor model is a mathematical model of concurrent computation that treats actors as the universal primitives of concurrent digital computation: in response to a message that it receives, an actor can make local decisions …   Wikipedia

  • Ibn al-Haytham — Infobox Muslim scholars | notability = Muslim scientist| era = Islamic Golden Age| color = #cef2e0 | | image caption = Ibn al Haytham drawing taken from a 1982 Iraqi 10 dinar note. | | name = Unicode|Abū ‘Alī al Ḥasan ibn al Ḥasan ibn al Haytham… …   Wikipedia

  • Alhazen — For the Moon crater, see Alhazen (crater). For the asteroid, see 59239 Alhazen. Alhazen Alhazen (Ibn al Haytham) …   Wikipedia

  • Curry–Howard correspondence — A proof written as a functional program: the proof of commutativity of addition on natural numbers in the proof assistant Coq. nat ind stands for mathematical induction, eq ind for substitution of equals and f equal for taking the same function… …   Wikipedia

  • Mobile Membranes — Membrane systems have been inspired from the structure and the functioning of the living cells. They were introduced and studied by Gh.Paun under the name of P systems [24]; some applications of the membrane systems are presented in [15].… …   Wikipedia

  • Concolic testing — (a portmanteau of concrete and symbolic) is a hybrid software verification technique that interleaves concrete execution (testing on particular inputs) with symbolic execution, a classical technique that treats program variables as symbolic… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.