- KIF Notation
- AsTMa (Asymptotic Topic Map), the Notation
- AUTHOR INFORMATION
kif2atm - KIF to AsTMa= converter
cat ontology.kif | kif2atm <command line switch>... > ontology.atm
This program reads the taxonomy definitions provided in KIF and returns a topic map in AsTMa= format.
All concepts and their subclass-superclass relations will be output in topic map form on STDOUT.
All other information (first order logic rules) is currently ignored. All conversion problems and warnings will go to STDERR.
...does hopefully what you would expect.
Writes out warnings onto STDERR.
Writes out statistical information at the end of the run to STDERR.
- limit (number)
If provided, limits the number of processed KIF sentences.
- start_line (number)
If provided all lines will be skipped in the KIF file and parsing will begin at this line number.
The full notation is documented at http://logic.stanford.edu/kif/dpans.html
Please refer to the online documentation http://astma.it.bond.edu.au/
Copyright 200, Robert Barta <firstname.lastname@example.org>, All rights reserved.