The Cade Atp System Competitions and Other Theorem Provers

Monty Newborn ()
Additional contact information
Monty Newborn: McGill University, School of Computer Science

Chapter 13 in Automated Theorem Proving, 2001, pp 181-206 from Springer

Abstract: Abstract For half a decade, the Conference on Automated Deduction has hosted an annual competition among automated theorem-proving systems. The first competition was held in 1996 at CADE-13 at Rutgers University. In 2000, the competition will take place at Carnegie Mellon University. THEO, under its previous name of TGTP, participated in the 1997 and 1998 competitions. A parallel version of TGTP called OCTOPUS participated in the 1997 competition. HERBY participated in the 1998 competition.

Keywords: Input Processing; Horn Clause; Binary Resolution; Automate Deduction; System Competition (search for similar items in EconPapers)
Date: 2001
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-0089-2_13

Ordering information: This item can be ordered from
http://www.springer.com/9781461300892

DOI: 10.1007/978-1-4613-0089-2_13

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().