Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Preface

Preface Ann Math Artif Intell (2009) 55:1–2 DOI 10.1007/s10472-009-9149-2 Silvio Ranise · Ullrich Hustadt Published online: 4 July 2009 © Springer Science + Business Media B.V. 2009 This special issue of Annals of Mathematics and Artificial Intelligence is devoted to first-order theorem proving. The role of first-order theorem proving as a core domain of automated deduction has been recognized since the first automated procedures were developed in the late 1950s and early 1960s. Since then, first-order order theorem proving and closely related techniques have made considerable progress, not only in proving mathematical theorems such as, for example, the Robbins algebra conjecture, but also in various other disciplines of Artificial Intelligence, including knowledge representation, model-based diagnosis, planning, symbolic computation, and verification. In 1997 the First-Order Theorem Proving Workshop Series was established in order to provide a forum for the presentation of new work in this area and the discussion of research in progress. The Sixth Workshop on First-Order Theorem Proving, FTP 2007, was held at the University of Liverpool, UK, in September 2007. The workshop was co-located with the Sixth International Symposium on Frontiers of Combining Systems, FroCoS’07. Following the workshop, this special issue has been put together. Submissions were not http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Mathematics and Artificial Intelligence Springer Journals

Preface

Download PDF
2 pages

Loading next page...
 
/lp/springer-journals/preface-c8r388HLYn

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Springer Journals
Copyright
Copyright © 2009 by Springer Science+Business Media B.V.
Subject
Computer Science; Statistical Physics, Dynamical Systems and Complexity; Mathematics, general; Computer Science, general; Artificial Intelligence (incl. Robotics)
ISSN
1012-2443
eISSN
1573-7470
DOI
10.1007/s10472-009-9149-2
Publisher site
See Article on Publisher Site

Abstract

Ann Math Artif Intell (2009) 55:1–2 DOI 10.1007/s10472-009-9149-2 Silvio Ranise · Ullrich Hustadt Published online: 4 July 2009 © Springer Science + Business Media B.V. 2009 This special issue of Annals of Mathematics and Artificial Intelligence is devoted to first-order theorem proving. The role of first-order theorem proving as a core domain of automated deduction has been recognized since the first automated procedures were developed in the late 1950s and early 1960s. Since then, first-order order theorem proving and closely related techniques have made considerable progress, not only in proving mathematical theorems such as, for example, the Robbins algebra conjecture, but also in various other disciplines of Artificial Intelligence, including knowledge representation, model-based diagnosis, planning, symbolic computation, and verification. In 1997 the First-Order Theorem Proving Workshop Series was established in order to provide a forum for the presentation of new work in this area and the discussion of research in progress. The Sixth Workshop on First-Order Theorem Proving, FTP 2007, was held at the University of Liverpool, UK, in September 2007. The workshop was co-located with the Sixth International Symposium on Frontiers of Combining Systems, FroCoS’07. Following the workshop, this special issue has been put together. Submissions were not

Journal

Annals of Mathematics and Artificial Intelligence – Springer Journals

Published: Jul 4, 2009

There are no references for this article.