Index of /2002/05/positive-triples/otterlang

[ICO]NameLast modifiedSizeDescription

[DIR]Parent Directory  -
[TXT]describe.py09-Aug-2002 02:16 6.7K
[   ]Makefile09-Aug-2002 20:46 73
[   ]parse.g01-Aug-2002 19:08 3.4K
[TXT]parse.py01-Aug-2002 19:08 5.9K
[TXT]recognize-alternative.py01-Aug-2002 19:08 1.4K
[TXT]recognize.P08-Aug-2002 20:02 3.5K
[TXT]recognize.py09-Aug-2002 19:20 1.4K
[TXT]samples.py08-Aug-2002 20:02 1.2K
[TXT]style.css01-Aug-2002 19:08 1.0K
[TXT]test.py09-Aug-2002 20:48 2.1K
[TXT]yappsrt.py01-Aug-2002 19:08 5.3K

otterlang (Otter's Language for First-Order Logic)

otterlang (Otter's Language for First-Order Logic)

I'm using Otter's syntax for first-order logic, and calling it "otterlang".

The code here can encode/describe otterlang formulas (or collections of formulas, aka knowledge bases) in RDF, and also decode/recognize them. These operations here are purely syntactic, with no real attention paid to the possible semantics of the triples generated and used. That stuff is handled elsewhere.


Sandro Hawke
$Date: 2002/08/01 19:36:44 $