scala-tptp-parser

Steen, Alexander

doi:10.5281/zenodo.4468958

No full text

Software (Computer developments)

scala-tptp-parser

Steen, Alexander

2021

Permalink
https://hdl.handle.net/10993/45929

DOI
10.5281/zenodo.4468958

Files (0)Send to Details Statistics Bibliography Similar publications

Files

Full Text

No document available.

Send to

RIS BibTex APA Chicago Permalink X Linkedin

Details

Keywords :

Automated Theorem Proving; Logic; Automated Reasoning; Parser

Abstract :

[en] scala-tptp-parser is a library for parsing the input languages of the TPTP infrastructure. The package contains a data structure for the abstract syntax tree (AST) of the parsed input as well as the parser for the different language of the TPTP, see http://tptp.org for details. In particular, the parser supports: - THF (TH0/TH1): Monomorphic and polymorphic higher-order logic, - TFF (TF0/TF1): Monomorphic and polymorphic typed first-order logic, - FOF: Untyped first-order logic, - CNF: (Untyped) clause-normal form, and - TPI: TPTP Process Instruction language.

Disciplines :

Computer science

Author, co-author :

Steen, Alexander ; University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)

Language :

English

Title :

scala-tptp-parser

Publication date :

26 January 2021

Creation date :

2021-01

Version :

1.2

Technical description :

Parser library written in Scala. Scala SBT is required to build the library.

Additional URL :

https://github.com/leoprover/scala-tptp-parser/

Commentary :

The parser is based on v7.4.0.3 of the TPTP syntax BNF (http://tptp.org/TPTP/SyntaxBNF.html).

Available on ORBilu :

since 26 January 2021

Statistics

Number of views

142 (13 by Unilu)

Number of downloads

0 (0 by Unilu)

More statistics