Reference : scala-tptp-parser
Computer developments : Software
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/45929
scala-tptp-parser
English
Steen, Alexander mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >]
26-Jan-2021
2021-01
[en] Automated Theorem Proving ; Logic ; Automated Reasoning ; Parser
[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.
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/45929
10.5281/zenodo.4468958
https://github.com/leoprover/scala-tptp-parser/
The parser is based on v7.4.0.3 of the TPTP syntax BNF (http://tptp.org/TPTP/SyntaxBNF.html).
Parser library written in Scala. Scala SBT is required to build the library.
1.2

There is no file associated with this reference.

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.