Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
SPASS Input Syntax Version 1.5
 

Summary: SPASS Input Syntax
Version 1.5
Christoph Weidenbach
Max-Planck-Institut f¨ur Informatik
Stuhlsatzenhausweg 85
66123 Saarbr¨ucken
weidenb@mpi-sb.mpg.de
Abstract
This document introduces the SPASS input syntax. It came out of the DFG syntax format that was thought to be a
format that can easily be parsed such that it forms a compromise between the needs of the different groups.
1 Introduction
The language proposed in the following is intended to be a common exchange format for logic problem settings. It is
thought to be a format that can easily be parsed such that it forms a compromise between the needs of the different groups.
Therefore, it is kept as simple as possible, in particular, the grammar of the language can be easily processed by some
automatic parser-generator.
In any case it will be necessary to provide tools that transform files from the present syntax into other standard formats
(e.g., Otter [6] or TPTP [9]) and vice versa. Currently we can (partly) transform Otter input files to DFG-Syntax files and
vice versa.
2 Notation
For the grammar defining the syntax, terminals are always underlined while non-terminals and meta-symbols are not.

  

Source: Abel, Andreas - Theoretische Informatik, Ludwig-Maximilians-Universität MĂĽnchen

 

Collections: Computer Technologies and Information Sciences