CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

The TPTP typed first-order form with arithmetic

G. Sutcliffe ; S. Schulz ; Koen Claessen (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; P. Baumgartner
Lecture Notes in Computer Science: 18th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, Merida, 11-15 March 2012 (0302-9743). Vol. 7180 (2012), p. 406-419.
[Konferensbidrag, refereegranskat]

The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has been extended to include a typed first-order logic, which in turn has enabled the integration of arithmetic. This paper describes these developments.

Nyckelord: Automated theorem proving, First order logic, First-order form, Artificial intelligence, Theorem proving, Automata theory



Denna post skapades 2012-07-06. Senast ändrad 2015-02-06.
CPL Pubid: 160192

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)


Institutioner (Chalmers)

Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)

Ämnesområden

Programvaruteknik

Chalmers infrastruktur