I am beginner to OpenCyc and I am trying to figure out how to use OpenCyc to
write some basic benchmarking problems (such as: nqueens programs, the
classic puzzle16 problem, etc.). I wonder if anyone can give me some
pointers on which parts of the documentation to read to speed up the process
and how to benchmark them (measure query time) using the basic CYC console.
I am not interested into using the Knowledge Base and Web interface, but in
the inference engine in the CYC console: to write CycL programs, measure the
time for asserting facts, query (and measure time). My stating problem is
the following: I have a list of facts (for instance edge/2) and I want to
compute the transitive closure (for some relation reach/2 defined as edge/2
or edge(X,Z),reach(Z,Y) ).
The manual is pretty descriptive on how to use the high level Web interface
for searching the knowledge base, but I find it pretty difficult to figure
out how to compile/load programs and query them in the CYC console. I am
still trying to figure out how to use the inference engine for querying
rules (not just facts in the KB, but rules over these facts, such as joins
"a(X,Y) and b(Y,Z)").
I am currently going over the manual. Please feel free to give me any
pointers of how to write basic tests in Cyc (such as: nqueens programs, the
classic puzzle16 problem, etc.) and how to compile/load/benchmark them in
the CYC console.
Thank you, regards,